./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c --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/popl20-mult-equiv.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fced0e87 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/weaver/popl20-mult-equiv.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-mult-equiv.wvr.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-wip.fs.extract-columns-fced0e8-m [2024-01-31 16:11:13,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 16:11:13,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 16:11:13,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 16:11:13,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 16:11:13,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 16:11:13,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 16:11:13,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 16:11:13,394 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 16:11:13,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 16:11:13,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 16:11:13,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 16:11:13,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 16:11:13,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 16:11:13,396 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 16:11:13,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 16:11:13,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 16:11:13,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 16:11:13,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 16:11:13,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 16:11:13,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 16:11:13,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 16:11:13,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 16:11:13,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 16:11:13,399 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 16:11:13,399 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 16:11:13,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 16:11:13,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 16:11:13,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 16:11:13,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 16:11:13,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 16:11:13,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 16:11:13,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:13,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 16:11:13,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 16:11:13,401 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 16:11:13,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 16:11:13,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 16:11:13,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 16:11:13,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 16:11:13,403 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 16:11:13,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 16:11:13,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 16:11:13,403 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 16:11:13,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 16:11:13,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 16:11:13,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 16:11:13,576 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 16:11:13,577 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 16:11:13,577 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/popl20-mult-equiv.wvr.yml/witness.yml [2024-01-31 16:11:13,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 16:11:13,687 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 16:11:13,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-01-31 16:11:14,840 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 16:11:14,980 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 16:11:14,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c [2024-01-31 16:11:14,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcf81444/775c8caa92654f2c9fb75defbda8dc9d/FLAG9d107060f [2024-01-31 16:11:14,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dcf81444/775c8caa92654f2c9fb75defbda8dc9d [2024-01-31 16:11:14,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 16:11:15,000 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 16:11:15,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:15,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 16:11:15,005 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 16:11:15,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:13" (1/2) ... [2024-01-31 16:11:15,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2ed755 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:15, skipping insertion in model container [2024-01-31 16:11:15,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:13" (1/2) ... [2024-01-31 16:11:15,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6f18aefd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 04:11:15, skipping insertion in model container [2024-01-31 16:11:15,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:14" (2/2) ... [2024-01-31 16:11:15,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2ed755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15, skipping insertion in model container [2024-01-31 16:11:15,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 04:11:14" (2/2) ... [2024-01-31 16:11:15,011 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 16:11:15,043 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 16:11:15,044 INFO L98 nessWitnessExtractor]: Location invariant before [L62-L62] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,044 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,044 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,044 INFO L98 nessWitnessExtractor]: Location invariant before [L92-L92] ((((L == 0U) && (M == 0U)) && (N == 0U)) && (p == 0U)) && (q == 0U) [2024-01-31 16:11:15,044 INFO L98 nessWitnessExtractor]: Location invariant before [L93-L93] (((M == 0U) && (N == 0U)) && (p == 0U)) && (q == 0U) [2024-01-31 16:11:15,045 INFO L98 nessWitnessExtractor]: Location invariant before [L41-L41] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,045 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,045 INFO L98 nessWitnessExtractor]: Location invariant before [L94-L94] ((N == 0U) && (p == 0U)) && (q == 0U) [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Location invariant before [L83-L83] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Loop invariant at [L63-L63] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Loop invariant at [L79-L79] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,048 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] ((1U <= N) && ((unsigned long )_argptr == 0UL)) && (N != 0U) [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant before [L60-L60] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant after [L61-L61] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,049 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (N <= 4294967293U) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:15,050 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] ((1U <= N) && ((unsigned long )_argptr == 0UL)) && (N != 0U) [2024-01-31 16:11:15,050 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,050 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,050 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((2U <= N) && ((unsigned long )_argptr == 0UL)) && (N != 0U) [2024-01-31 16:11:15,050 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((2U <= N) && ((unsigned long )_argptr == 0UL)) && (N != 0U) [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (N <= 4294967294U) && ((unsigned long )_argptr == 0UL) [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Location invariant after [L42-L42] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,051 INFO L98 nessWitnessExtractor]: Loop invariant at [L44-L44] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,052 INFO L98 nessWitnessExtractor]: Location invariant before [L97-L97] (p == 0U) && (q == 0U) [2024-01-31 16:11:15,052 INFO L98 nessWitnessExtractor]: Location invariant before [L82-L82] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,052 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,052 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (unsigned long )_argptr == 0UL [2024-01-31 16:11:15,072 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 16:11:15,202 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-01-31 16:11:15,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:15,211 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local [2024-01-31 16:11:15,237 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:11:15,237 WARN L424 MainDispatcher]: Unable to annotate cond = N > 0 with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:11:15,243 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 16:11:15,244 WARN L424 MainDispatcher]: Unable to annotate cond = N > 1 with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-31 16:11:15,270 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2024-01-31 16:11:15,273 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 16:11:15,286 INFO L208 MainTranslator]: Completed translation [2024-01-31 16:11:15,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15 WrapperNode [2024-01-31 16:11:15,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 16:11:15,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:15,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 16:11:15,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 16:11:15,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,330 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2024-01-31 16:11:15,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 16:11:15,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 16:11:15,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 16:11:15,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 16:11:15,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,367 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-31 16:11:15,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 16:11:15,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 16:11:15,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 16:11:15,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 16:11:15,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (1/1) ... [2024-01-31 16:11:15,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 16:11:15,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:11:15,413 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 16:11:15,448 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 16:11:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 16:11:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 16:11:15,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 16:11:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 16:11:15,475 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 16:11:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 16:11:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 16:11:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 16:11:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 16:11:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 16:11:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 16:11:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 16:11:15,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 16:11:15,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 16:11:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 16:11:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 16:11:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 16:11:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 16:11:15,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 16:11:15,479 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 16:11:15,577 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 16:11:15,579 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 16:11:15,943 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 16:11:15,943 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 16:11:16,111 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 16:11:16,111 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-31 16:11:16,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:16 BoogieIcfgContainer [2024-01-31 16:11:16,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 16:11:16,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 16:11:16,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 16:11:16,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 16:11:16,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 04:11:13" (1/4) ... [2024-01-31 16:11:16,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515505d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 04:11:16, skipping insertion in model container [2024-01-31 16:11:16,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 04:11:14" (2/4) ... [2024-01-31 16:11:16,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515505d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:16, skipping insertion in model container [2024-01-31 16:11:16,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 04:11:15" (3/4) ... [2024-01-31 16:11:16,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@515505d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:11:16, skipping insertion in model container [2024-01-31 16:11:16,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:11:16" (4/4) ... [2024-01-31 16:11:16,118 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-01-31 16:11:16,130 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 16:11:16,130 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-01-31 16:11:16,130 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 16:11:16,196 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 16:11:16,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 197 flow [2024-01-31 16:11:16,260 INFO L124 PetriNetUnfolderBase]: 6/85 cut-off events. [2024-01-31 16:11:16,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 16:11:16,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 6/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 283 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2024-01-31 16:11:16,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 88 transitions, 197 flow [2024-01-31 16:11:16,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 84 transitions, 186 flow [2024-01-31 16:11:16,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 16:11:16,287 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;@595decbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 16:11:16,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 68 error locations. [2024-01-31 16:11:16,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 16:11:16,289 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-31 16:11:16,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-31 16:11:16,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:16,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-31 16:11:16,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:16,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 13125, now seen corresponding path program 1 times [2024-01-31 16:11:16,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:16,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730269931] [2024-01-31 16:11:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:16,714 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 16:11:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730269931] [2024-01-31 16:11:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730269931] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:16,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:16,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-31 16:11:16,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941274371] [2024-01-31 16:11:16,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:16,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:16,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 88 [2024-01-31 16:11:16,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 16:11:16,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:16,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 88 [2024-01-31 16:11:16,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:17,167 INFO L124 PetriNetUnfolderBase]: 1504/2783 cut-off events. [2024-01-31 16:11:17,167 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-01-31 16:11:17,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5090 conditions, 2783 events. 1504/2783 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20690 event pairs, 1159 based on Foata normal form. 345/2101 useless extension candidates. Maximal degree in co-relation 4527. Up to 2147 conditions per place. [2024-01-31 16:11:17,187 INFO L140 encePairwiseOnDemand]: 72/88 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-01-31 16:11:17,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 234 flow [2024-01-31 16:11:17,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:17,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2024-01-31 16:11:17,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5946969696969697 [2024-01-31 16:11:17,198 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 186 flow. Second operand 3 states and 157 transitions. [2024-01-31 16:11:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 234 flow [2024-01-31 16:11:17,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 222 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 16:11:17,215 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 150 flow [2024-01-31 16:11:17,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-01-31 16:11:17,223 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -15 predicate places. [2024-01-31 16:11:17,223 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 150 flow [2024-01-31 16:11:17,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 16:11:17,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:17,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-31 16:11:17,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 16:11:17,230 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:17,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:17,230 INFO L85 PathProgramCache]: Analyzing trace with hash 407293, now seen corresponding path program 1 times [2024-01-31 16:11:17,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:17,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227866810] [2024-01-31 16:11:17,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:17,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:17,295 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 16:11:17,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:17,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227866810] [2024-01-31 16:11:17,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227866810] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:17,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:17,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:11:17,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555713547] [2024-01-31 16:11:17,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:17,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:17,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:17,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:11:17,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 16:11:17,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:17,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:11:17,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:17,507 INFO L124 PetriNetUnfolderBase]: 1294/2654 cut-off events. [2024-01-31 16:11:17,507 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-31 16:11:17,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4538 conditions, 2654 events. 1294/2654 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 20385 event pairs, 914 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 4529. Up to 1821 conditions per place. [2024-01-31 16:11:17,522 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 34 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-01-31 16:11:17,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 220 flow [2024-01-31 16:11:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-01-31 16:11:17,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606060606060606 [2024-01-31 16:11:17,528 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 150 flow. Second operand 3 states and 148 transitions. [2024-01-31 16:11:17,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 220 flow [2024-01-31 16:11:17,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:17,531 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 148 flow [2024-01-31 16:11:17,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-01-31 16:11:17,531 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -16 predicate places. [2024-01-31 16:11:17,532 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 148 flow [2024-01-31 16:11:17,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 16:11:17,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:17,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-31 16:11:17,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 16:11:17,532 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:17,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:17,533 INFO L85 PathProgramCache]: Analyzing trace with hash 12626530, now seen corresponding path program 1 times [2024-01-31 16:11:17,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:17,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620467266] [2024-01-31 16:11:17,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:17,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:17,580 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 16:11:17,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:17,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620467266] [2024-01-31 16:11:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620467266] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:11:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773140122] [2024-01-31 16:11:17,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:17,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:17,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:17,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:17,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 88 [2024-01-31 16:11:17,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 16:11:17,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:17,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 88 [2024-01-31 16:11:17,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:17,786 INFO L124 PetriNetUnfolderBase]: 1294/2653 cut-off events. [2024-01-31 16:11:17,786 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-01-31 16:11:17,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 2653 events. 1294/2653 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 20490 event pairs, 914 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 4525. Up to 1819 conditions per place. [2024-01-31 16:11:17,798 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 33 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-31 16:11:17,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 216 flow [2024-01-31 16:11:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:17,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:17,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-01-31 16:11:17,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2024-01-31 16:11:17,800 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 148 flow. Second operand 3 states and 150 transitions. [2024-01-31 16:11:17,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 216 flow [2024-01-31 16:11:17,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:17,802 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 146 flow [2024-01-31 16:11:17,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-01-31 16:11:17,802 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places. [2024-01-31 16:11:17,803 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 146 flow [2024-01-31 16:11:17,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 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 16:11:17,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:17,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-31 16:11:17,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 16:11:17,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:17,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:17,804 INFO L85 PathProgramCache]: Analyzing trace with hash 391422808, now seen corresponding path program 1 times [2024-01-31 16:11:17,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758723489] [2024-01-31 16:11:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:17,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:17,834 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 16:11:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758723489] [2024-01-31 16:11:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758723489] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 16:11:17,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509896198] [2024-01-31 16:11:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:17,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 16:11:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:17,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 16:11:17,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 16:11:17,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 88 [2024-01-31 16:11:17,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 16:11:17,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:17,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 88 [2024-01-31 16:11:17,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:18,136 INFO L124 PetriNetUnfolderBase]: 2034/4049 cut-off events. [2024-01-31 16:11:18,136 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-01-31 16:11:18,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 4049 events. 2034/4049 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 32977 event pairs, 440 based on Foata normal form. 1/2519 useless extension candidates. Maximal degree in co-relation 6958. Up to 2183 conditions per place. [2024-01-31 16:11:18,162 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 52 selfloop transitions, 4 changer transitions 1/90 dead transitions. [2024-01-31 16:11:18,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 309 flow [2024-01-31 16:11:18,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 16:11:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 16:11:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2024-01-31 16:11:18,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-01-31 16:11:18,168 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 146 flow. Second operand 3 states and 176 transitions. [2024-01-31 16:11:18,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 309 flow [2024-01-31 16:11:18,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 90 transitions, 305 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:18,171 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 166 flow [2024-01-31 16:11:18,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2024-01-31 16:11:18,172 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -17 predicate places. [2024-01-31 16:11:18,172 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 166 flow [2024-01-31 16:11:18,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 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 16:11:18,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:18,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-31 16:11:18,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:18,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 41184664, now seen corresponding path program 1 times [2024-01-31 16:11:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:18,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53028089] [2024-01-31 16:11:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:18,233 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 16:11:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53028089] [2024-01-31 16:11:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53028089] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246960142] [2024-01-31 16:11:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:18,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:11:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:11:18,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:11:18,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 88 [2024-01-31 16:11:18,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 16:11:18,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:18,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 88 [2024-01-31 16:11:18,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:18,455 INFO L124 PetriNetUnfolderBase]: 1516/2937 cut-off events. [2024-01-31 16:11:18,455 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-01-31 16:11:18,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5679 conditions, 2937 events. 1516/2937 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 21870 event pairs, 664 based on Foata normal form. 484/2804 useless extension candidates. Maximal degree in co-relation 1565. Up to 1882 conditions per place. [2024-01-31 16:11:18,470 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 50 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-31 16:11:18,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 300 flow [2024-01-31 16:11:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:11:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:11:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2024-01-31 16:11:18,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5426136363636364 [2024-01-31 16:11:18,471 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 166 flow. Second operand 4 states and 191 transitions. [2024-01-31 16:11:18,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 300 flow [2024-01-31 16:11:18,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 79 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 16:11:18,473 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 150 flow [2024-01-31 16:11:18,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2024-01-31 16:11:18,475 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -23 predicate places. [2024-01-31 16:11:18,475 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 150 flow [2024-01-31 16:11:18,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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 16:11:18,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:18,476 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:18,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-31 16:11:18,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:18,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash 921834522, now seen corresponding path program 1 times [2024-01-31 16:11:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824503129] [2024-01-31 16:11:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:18,566 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 16:11:18,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:18,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824503129] [2024-01-31 16:11:18,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824503129] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:18,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:18,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:18,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18273879] [2024-01-31 16:11:18,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:18,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:11:18,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:18,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:11:18,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:11:18,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 88 [2024-01-31 16:11:18,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 16:11:18,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:18,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 88 [2024-01-31 16:11:18,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:18,737 INFO L124 PetriNetUnfolderBase]: 860/1781 cut-off events. [2024-01-31 16:11:18,737 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-01-31 16:11:18,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3340 conditions, 1781 events. 860/1781 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12754 event pairs, 77 based on Foata normal form. 356/1907 useless extension candidates. Maximal degree in co-relation 3319. Up to 1048 conditions per place. [2024-01-31 16:11:18,744 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 49 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2024-01-31 16:11:18,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 288 flow [2024-01-31 16:11:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:11:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:11:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2024-01-31 16:11:18,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5369318181818182 [2024-01-31 16:11:18,746 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 150 flow. Second operand 4 states and 189 transitions. [2024-01-31 16:11:18,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 288 flow [2024-01-31 16:11:18,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:18,749 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 135 flow [2024-01-31 16:11:18,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-01-31 16:11:18,752 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -30 predicate places. [2024-01-31 16:11:18,752 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 135 flow [2024-01-31 16:11:18,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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 16:11:18,752 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:18,752 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 16:11:18,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-31 16:11:18,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:18,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1116668107, now seen corresponding path program 1 times [2024-01-31 16:11:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:18,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724175882] [2024-01-31 16:11:18,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:18,820 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 16:11:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724175882] [2024-01-31 16:11:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724175882] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 16:11:18,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287769228] [2024-01-31 16:11:18,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 16:11:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:18,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 16:11:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 16:11:18,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 88 [2024-01-31 16:11:18,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 16:11:18,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:18,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 88 [2024-01-31 16:11:18,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:18,962 INFO L124 PetriNetUnfolderBase]: 575/1169 cut-off events. [2024-01-31 16:11:18,962 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-01-31 16:11:18,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2260 conditions, 1169 events. 575/1169 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7448 event pairs, 59 based on Foata normal form. 204/1254 useless extension candidates. Maximal degree in co-relation 2240. Up to 519 conditions per place. [2024-01-31 16:11:18,967 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 54 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2024-01-31 16:11:18,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 307 flow [2024-01-31 16:11:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 16:11:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 16:11:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2024-01-31 16:11:18,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5596590909090909 [2024-01-31 16:11:18,968 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 135 flow. Second operand 4 states and 197 transitions. [2024-01-31 16:11:18,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 307 flow [2024-01-31 16:11:18,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 75 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:18,970 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 128 flow [2024-01-31 16:11:18,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-01-31 16:11:18,971 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -33 predicate places. [2024-01-31 16:11:18,971 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 128 flow [2024-01-31 16:11:18,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 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 16:11:18,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:18,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:18,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-31 16:11:18,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:18,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1822355199, now seen corresponding path program 1 times [2024-01-31 16:11:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:18,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906322347] [2024-01-31 16:11:18,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906322347] [2024-01-31 16:11:19,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906322347] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:19,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:11:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754469809] [2024-01-31 16:11:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:11:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:11:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:11:19,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:11:19,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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 16:11:19,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:19,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:11:19,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:19,452 INFO L124 PetriNetUnfolderBase]: 1322/2311 cut-off events. [2024-01-31 16:11:19,452 INFO L125 PetriNetUnfolderBase]: For 380/392 co-relation queries the response was YES. [2024-01-31 16:11:19,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4698 conditions, 2311 events. 1322/2311 cut-off events. For 380/392 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 14269 event pairs, 135 based on Foata normal form. 12/2165 useless extension candidates. Maximal degree in co-relation 4678. Up to 714 conditions per place. [2024-01-31 16:11:19,460 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 86 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2024-01-31 16:11:19,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 119 transitions, 513 flow [2024-01-31 16:11:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-31 16:11:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-31 16:11:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 358 transitions. [2024-01-31 16:11:19,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5811688311688312 [2024-01-31 16:11:19,462 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 128 flow. Second operand 7 states and 358 transitions. [2024-01-31 16:11:19,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 119 transitions, 513 flow [2024-01-31 16:11:19,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 119 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:19,464 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 231 flow [2024-01-31 16:11:19,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2024-01-31 16:11:19,464 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -25 predicate places. [2024-01-31 16:11:19,464 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 231 flow [2024-01-31 16:11:19,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 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 16:11:19,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:19,465 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:19,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-31 16:11:19,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:19,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:19,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1608317279, now seen corresponding path program 2 times [2024-01-31 16:11:19,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:19,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514564323] [2024-01-31 16:11:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:19,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514564323] [2024-01-31 16:11:19,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514564323] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:19,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:19,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:11:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118066297] [2024-01-31 16:11:19,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:19,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:19,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:11:19,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 16:11:19,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:19,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:11:19,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:19,937 INFO L124 PetriNetUnfolderBase]: 1497/2592 cut-off events. [2024-01-31 16:11:19,937 INFO L125 PetriNetUnfolderBase]: For 1529/1553 co-relation queries the response was YES. [2024-01-31 16:11:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 2592 events. 1497/2592 cut-off events. For 1529/1553 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16476 event pairs, 257 based on Foata normal form. 62/2574 useless extension candidates. Maximal degree in co-relation 6197. Up to 1582 conditions per place. [2024-01-31 16:11:19,949 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 70 selfloop transitions, 21 changer transitions 3/111 dead transitions. [2024-01-31 16:11:19,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 111 transitions, 590 flow [2024-01-31 16:11:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:11:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:11:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2024-01-31 16:11:19,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-01-31 16:11:19,951 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 231 flow. Second operand 6 states and 304 transitions. [2024-01-31 16:11:19,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 111 transitions, 590 flow [2024-01-31 16:11:19,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 590 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-31 16:11:19,954 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 371 flow [2024-01-31 16:11:19,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2024-01-31 16:11:19,955 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -16 predicate places. [2024-01-31 16:11:19,955 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 371 flow [2024-01-31 16:11:19,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 16:11:19,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:19,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:19,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-31 16:11:19,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:19,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 539545335, now seen corresponding path program 3 times [2024-01-31 16:11:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406219682] [2024-01-31 16:11:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:19,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406219682] [2024-01-31 16:11:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406219682] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:20,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:20,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-31 16:11:20,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805260144] [2024-01-31 16:11:20,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:20,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 16:11:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 16:11:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-31 16:11:20,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 88 [2024-01-31 16:11:20,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 371 flow. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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 16:11:20,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:20,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 88 [2024-01-31 16:11:20,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:20,670 INFO L124 PetriNetUnfolderBase]: 2981/5137 cut-off events. [2024-01-31 16:11:20,671 INFO L125 PetriNetUnfolderBase]: For 3885/3895 co-relation queries the response was YES. [2024-01-31 16:11:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12692 conditions, 5137 events. 2981/5137 cut-off events. For 3885/3895 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 36322 event pairs, 259 based on Foata normal form. 48/5086 useless extension candidates. Maximal degree in co-relation 12655. Up to 1710 conditions per place. [2024-01-31 16:11:20,738 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 107 selfloop transitions, 36 changer transitions 3/162 dead transitions. [2024-01-31 16:11:20,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 162 transitions, 955 flow [2024-01-31 16:11:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-31 16:11:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-31 16:11:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 419 transitions. [2024-01-31 16:11:20,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5951704545454546 [2024-01-31 16:11:20,741 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 371 flow. Second operand 8 states and 419 transitions. [2024-01-31 16:11:20,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 162 transitions, 955 flow [2024-01-31 16:11:20,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 162 transitions, 911 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:20,751 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 565 flow [2024-01-31 16:11:20,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=565, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2024-01-31 16:11:20,753 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -6 predicate places. [2024-01-31 16:11:20,753 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 565 flow [2024-01-31 16:11:20,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 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 16:11:20,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:20,754 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:20,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-31 16:11:20,754 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:20,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:20,755 INFO L85 PathProgramCache]: Analyzing trace with hash 628042669, now seen corresponding path program 4 times [2024-01-31 16:11:20,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:20,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918793558] [2024-01-31 16:11:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:20,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918793558] [2024-01-31 16:11:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918793558] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:11:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241699065] [2024-01-31 16:11:20,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-31 16:11:20,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:11:20,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:11:20,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:11:20,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-31 16:11:21,022 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-31 16:11:21,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 16:11:21,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-31 16:11:21,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:11:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:21,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:11:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241699065] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:11:21,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:11:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-01-31 16:11:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384651668] [2024-01-31 16:11:21,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:11:21,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-31 16:11:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:21,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-31 16:11:21,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-01-31 16:11:21,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 88 [2024-01-31 16:11:21,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 565 flow. Second operand has 13 states, 13 states have (on average 40.38461538461539) internal successors, (525), 13 states have internal predecessors, (525), 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 16:11:21,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:21,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 88 [2024-01-31 16:11:21,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:24,307 INFO L124 PetriNetUnfolderBase]: 11586/20767 cut-off events. [2024-01-31 16:11:24,307 INFO L125 PetriNetUnfolderBase]: For 29290/29334 co-relation queries the response was YES. [2024-01-31 16:11:24,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54567 conditions, 20767 events. 11586/20767 cut-off events. For 29290/29334 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 180419 event pairs, 780 based on Foata normal form. 347/20524 useless extension candidates. Maximal degree in co-relation 54523. Up to 3499 conditions per place. [2024-01-31 16:11:24,429 INFO L140 encePairwiseOnDemand]: 76/88 looper letters, 386 selfloop transitions, 234 changer transitions 0/636 dead transitions. [2024-01-31 16:11:24,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 636 transitions, 4271 flow [2024-01-31 16:11:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-01-31 16:11:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2024-01-31 16:11:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 1956 transitions. [2024-01-31 16:11:24,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5556818181818182 [2024-01-31 16:11:24,433 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 565 flow. Second operand 40 states and 1956 transitions. [2024-01-31 16:11:24,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 636 transitions, 4271 flow [2024-01-31 16:11:24,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 636 transitions, 4238 flow, removed 13 selfloop flow, removed 1 redundant places. [2024-01-31 16:11:24,462 INFO L231 Difference]: Finished difference. Result has 151 places, 333 transitions, 3134 flow [2024-01-31 16:11:24,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3134, PETRI_PLACES=151, PETRI_TRANSITIONS=333} [2024-01-31 16:11:24,463 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 63 predicate places. [2024-01-31 16:11:24,463 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 333 transitions, 3134 flow [2024-01-31 16:11:24,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 40.38461538461539) internal successors, (525), 13 states have internal predecessors, (525), 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 16:11:24,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:24,464 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:24,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 16:11:24,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-01-31 16:11:24,676 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:24,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:24,676 INFO L85 PathProgramCache]: Analyzing trace with hash -834488417, now seen corresponding path program 1 times [2024-01-31 16:11:24,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:24,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426522088] [2024-01-31 16:11:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:24,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426522088] [2024-01-31 16:11:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426522088] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 16:11:24,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707087414] [2024-01-31 16:11:24,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:24,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 16:11:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 16:11:24,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 16:11:24,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-31 16:11:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:24,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-31 16:11:24,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 16:11:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:25,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 16:11:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707087414] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 16:11:25,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 16:11:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 13 [2024-01-31 16:11:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746785180] [2024-01-31 16:11:25,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 16:11:25,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-31 16:11:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:25,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-31 16:11:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-01-31 16:11:25,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 88 [2024-01-31 16:11:25,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 333 transitions, 3134 flow. Second operand has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 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 16:11:25,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:25,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 88 [2024-01-31 16:11:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:29,112 INFO L124 PetriNetUnfolderBase]: 12180/22220 cut-off events. [2024-01-31 16:11:29,112 INFO L125 PetriNetUnfolderBase]: For 171399/171949 co-relation queries the response was YES. [2024-01-31 16:11:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82319 conditions, 22220 events. 12180/22220 cut-off events. For 171399/171949 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 200669 event pairs, 1598 based on Foata normal form. 71/21636 useless extension candidates. Maximal degree in co-relation 82239. Up to 10522 conditions per place. [2024-01-31 16:11:29,321 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 363 selfloop transitions, 114 changer transitions 6/505 dead transitions. [2024-01-31 16:11:29,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 505 transitions, 5148 flow [2024-01-31 16:11:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-31 16:11:29,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-31 16:11:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 587 transitions. [2024-01-31 16:11:29,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5558712121212122 [2024-01-31 16:11:29,323 INFO L175 Difference]: Start difference. First operand has 151 places, 333 transitions, 3134 flow. Second operand 12 states and 587 transitions. [2024-01-31 16:11:29,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 505 transitions, 5148 flow [2024-01-31 16:11:29,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 505 transitions, 4655 flow, removed 243 selfloop flow, removed 1 redundant places. [2024-01-31 16:11:29,975 INFO L231 Difference]: Finished difference. Result has 166 places, 376 transitions, 3496 flow [2024-01-31 16:11:29,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2765, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3496, PETRI_PLACES=166, PETRI_TRANSITIONS=376} [2024-01-31 16:11:29,978 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 78 predicate places. [2024-01-31 16:11:29,978 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 376 transitions, 3496 flow [2024-01-31 16:11:29,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.0) internal successors, (533), 13 states have internal predecessors, (533), 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 16:11:29,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:29,978 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:29,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-31 16:11:30,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-31 16:11:30,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:30,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2087261275, now seen corresponding path program 2 times [2024-01-31 16:11:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:30,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520411588] [2024-01-31 16:11:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:30,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520411588] [2024-01-31 16:11:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520411588] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:11:30,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092498501] [2024-01-31 16:11:30,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:30,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:30,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:11:30,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 376 transitions, 3496 flow. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 16:11:30,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:30,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:11:30,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:33,521 INFO L124 PetriNetUnfolderBase]: 12272/22378 cut-off events. [2024-01-31 16:11:33,522 INFO L125 PetriNetUnfolderBase]: For 256719/257285 co-relation queries the response was YES. [2024-01-31 16:11:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86330 conditions, 22378 events. 12272/22378 cut-off events. For 256719/257285 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 202877 event pairs, 3084 based on Foata normal form. 103/21643 useless extension candidates. Maximal degree in co-relation 86241. Up to 16484 conditions per place. [2024-01-31 16:11:33,748 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 329 selfloop transitions, 27 changer transitions 0/415 dead transitions. [2024-01-31 16:11:33,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 415 transitions, 4461 flow [2024-01-31 16:11:33,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:11:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:11:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2024-01-31 16:11:33,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5931818181818181 [2024-01-31 16:11:33,750 INFO L175 Difference]: Start difference. First operand has 166 places, 376 transitions, 3496 flow. Second operand 5 states and 261 transitions. [2024-01-31 16:11:33,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 415 transitions, 4461 flow [2024-01-31 16:11:34,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 415 transitions, 4390 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-01-31 16:11:34,510 INFO L231 Difference]: Finished difference. Result has 169 places, 378 transitions, 3586 flow [2024-01-31 16:11:34,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3586, PETRI_PLACES=169, PETRI_TRANSITIONS=378} [2024-01-31 16:11:34,511 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 81 predicate places. [2024-01-31 16:11:34,511 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 378 transitions, 3586 flow [2024-01-31 16:11:34,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 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 16:11:34,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:34,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:34,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-31 16:11:34,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:34,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:34,512 INFO L85 PathProgramCache]: Analyzing trace with hash 818757465, now seen corresponding path program 1 times [2024-01-31 16:11:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:34,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224573579] [2024-01-31 16:11:34,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:34,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:34,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:34,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224573579] [2024-01-31 16:11:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224573579] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:34,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:11:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362080653] [2024-01-31 16:11:34,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:34,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:34,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:34,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:34,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:34,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 88 [2024-01-31 16:11:34,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 378 transitions, 3586 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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 16:11:34,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:34,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 88 [2024-01-31 16:11:34,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:36,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L45-1-->L50: Formula: (let ((.cse0 (= (mod (+ v_thread1Thread1of1ForFork2_~_argptr.base_31 v_thread1Thread1of1ForFork2_~_argptr.offset_31) 4294967296) 0))) (and .cse0 (let ((.cse1 (mod v_~N~0_168 4294967296))) (or (and (= v_~p~0_133 v_~p~0_134) (= v_~N~0_168 v_~N~0_167) (= |v_thread1Thread1of1ForFork2_#t~post1_6| |v_thread1Thread1of1ForFork2_#t~post1_5|) (<= .cse1 0)) (and (not (= .cse1 0)) .cse0 (< 0 .cse1) (<= 1 .cse1) (= v_~N~0_168 (+ v_~N~0_167 1)) (= v_~p~0_133 (+ v_~p~0_134 v_~M~0_88))))) (<= (mod v_~N~0_167 4294967296) 4294967294))) InVars {~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_5|, ~p~0=v_~p~0_134, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_168, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} OutVars{~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_6|, ~p~0=v_~p~0_133, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_167, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][241], [Black: 130#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 32#L79-3true, Black: 133#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 129#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 153#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))), Black: 144#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 149#true, 749#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 152#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 767#true, 125#(and (= thread3Thread1of1ForFork1_~_argptr.offset 0) (= |thread3Thread1of1ForFork1_#in~_argptr.base| 0) (= thread3Thread1of1ForFork1_~_argptr.base 0) (= |thread3Thread1of1ForFork1_#in~_argptr.offset| 0)), 4#L100-1true, 113#(and (= |thread1Thread1of1ForFork2_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork2_~_argptr.offset 0) (= |thread1Thread1of1ForFork2_#in~_argptr.base| 0) (= thread1Thread1of1ForFork2_~_argptr.base 0)), 319#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), 131#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 451#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 170#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 407#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), 119#(and (= |thread2Thread1of1ForFork0_#in~_argptr.base| 0) (= thread2Thread1of1ForFork0_~_argptr.base 0) (= thread2Thread1of1ForFork0_~_argptr.offset 0) (= |thread2Thread1of1ForFork0_#in~_argptr.offset| 0)), Black: 425#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 300#(< 0 (mod ~L~0 4294967296)), Black: 459#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 167#(= ~N~0 ~L~0), Black: 455#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 445#(and (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 49#L69true, Black: 165#true, Black: 421#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 423#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 409#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 439#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 326#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 405#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 403#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 457#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 447#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 443#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)))), Black: 339#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 435#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 417#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 427#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 449#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 169#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 453#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 441#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 106#(and (= ~q~0 (* 4294967296 (div ~q~0 4294967296))) (= (* 4294967296 (div ~p~0 4294967296)) ~p~0)), Black: 739#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 751#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 758#true, Black: 737#(or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 747#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 64#L50true, Black: 764#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 761#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0))]) [2024-01-31 16:11:36,521 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-31 16:11:36,522 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 16:11:36,522 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-31 16:11:36,524 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-31 16:11:36,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L45-1-->L50: Formula: (let ((.cse0 (= (mod (+ v_thread1Thread1of1ForFork2_~_argptr.base_31 v_thread1Thread1of1ForFork2_~_argptr.offset_31) 4294967296) 0))) (and .cse0 (let ((.cse1 (mod v_~N~0_168 4294967296))) (or (and (= v_~p~0_133 v_~p~0_134) (= v_~N~0_168 v_~N~0_167) (= |v_thread1Thread1of1ForFork2_#t~post1_6| |v_thread1Thread1of1ForFork2_#t~post1_5|) (<= .cse1 0)) (and (not (= .cse1 0)) .cse0 (< 0 .cse1) (<= 1 .cse1) (= v_~N~0_168 (+ v_~N~0_167 1)) (= v_~p~0_133 (+ v_~p~0_134 v_~M~0_88))))) (<= (mod v_~N~0_167 4294967296) 4294967294))) InVars {~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_5|, ~p~0=v_~p~0_134, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_168, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} OutVars{~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_6|, ~p~0=v_~p~0_133, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_167, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][242], [Black: 130#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 32#L79-3true, Black: 133#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 129#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 153#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))), Black: 144#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 149#true, 749#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 152#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 767#true, 125#(and (= thread3Thread1of1ForFork1_~_argptr.offset 0) (= |thread3Thread1of1ForFork1_#in~_argptr.base| 0) (= thread3Thread1of1ForFork1_~_argptr.base 0) (= |thread3Thread1of1ForFork1_#in~_argptr.offset| 0)), 4#L100-1true, 31#L72-1true, 113#(and (= |thread1Thread1of1ForFork2_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork2_~_argptr.offset 0) (= |thread1Thread1of1ForFork2_#in~_argptr.base| 0) (= thread1Thread1of1ForFork2_~_argptr.base 0)), 319#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), 131#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 451#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 170#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 407#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), 119#(and (= |thread2Thread1of1ForFork0_#in~_argptr.base| 0) (= thread2Thread1of1ForFork0_~_argptr.base 0) (= thread2Thread1of1ForFork0_~_argptr.offset 0) (= |thread2Thread1of1ForFork0_#in~_argptr.offset| 0)), Black: 425#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 300#(< 0 (mod ~L~0 4294967296)), Black: 459#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 167#(= ~N~0 ~L~0), Black: 455#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 445#(and (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#true, Black: 421#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 423#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 409#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 439#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 326#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 405#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 403#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 457#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 447#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 443#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)))), Black: 339#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 435#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 417#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 427#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 449#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 169#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 453#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 441#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 106#(and (= ~q~0 (* 4294967296 (div ~q~0 4294967296))) (= (* 4294967296 (div ~p~0 4294967296)) ~p~0)), Black: 739#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 751#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 758#true, Black: 737#(or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 747#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 64#L50true, Black: 764#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 761#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0))]) [2024-01-31 16:11:36,524 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-31 16:11:36,525 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 16:11:36,525 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-31 16:11:36,525 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-31 16:11:37,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L45-1-->L50: Formula: (let ((.cse0 (= (mod (+ v_thread1Thread1of1ForFork2_~_argptr.base_31 v_thread1Thread1of1ForFork2_~_argptr.offset_31) 4294967296) 0))) (and .cse0 (let ((.cse1 (mod v_~N~0_168 4294967296))) (or (and (= v_~p~0_133 v_~p~0_134) (= v_~N~0_168 v_~N~0_167) (= |v_thread1Thread1of1ForFork2_#t~post1_6| |v_thread1Thread1of1ForFork2_#t~post1_5|) (<= .cse1 0)) (and (not (= .cse1 0)) .cse0 (< 0 .cse1) (<= 1 .cse1) (= v_~N~0_168 (+ v_~N~0_167 1)) (= v_~p~0_133 (+ v_~p~0_134 v_~M~0_88))))) (<= (mod v_~N~0_167 4294967296) 4294967294))) InVars {~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_5|, ~p~0=v_~p~0_134, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_168, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} OutVars{~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_6|, ~p~0=v_~p~0_133, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_167, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][277], [Black: 130#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 32#L79-3true, Black: 133#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 129#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 153#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))), Black: 144#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 149#true, Black: 152#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 749#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 767#true, 125#(and (= thread3Thread1of1ForFork1_~_argptr.offset 0) (= |thread3Thread1of1ForFork1_#in~_argptr.base| 0) (= thread3Thread1of1ForFork1_~_argptr.base 0) (= |thread3Thread1of1ForFork1_#in~_argptr.offset| 0)), 4#L100-1true, 113#(and (= |thread1Thread1of1ForFork2_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork2_~_argptr.offset 0) (= |thread1Thread1of1ForFork2_#in~_argptr.base| 0) (= thread1Thread1of1ForFork2_~_argptr.base 0)), 319#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), 131#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 451#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 170#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 407#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), 119#(and (= |thread2Thread1of1ForFork0_#in~_argptr.base| 0) (= thread2Thread1of1ForFork0_~_argptr.base 0) (= thread2Thread1of1ForFork0_~_argptr.offset 0) (= |thread2Thread1of1ForFork0_#in~_argptr.offset| 0)), Black: 425#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 300#(< 0 (mod ~L~0 4294967296)), Black: 459#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 167#(= ~N~0 ~L~0), Black: 455#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 445#(and (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#true, Black: 421#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 423#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 409#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 439#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 326#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 405#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 403#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 457#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 447#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 443#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)))), Black: 339#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 435#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 417#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 427#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 449#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 169#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 453#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 441#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 106#(and (= ~q~0 (* 4294967296 (div ~q~0 4294967296))) (= (* 4294967296 (div ~p~0 4294967296)) ~p~0)), Black: 739#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 751#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 758#true, Black: 737#(or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 747#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 64#L50true, 13#L64true, Black: 764#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 761#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0))]) [2024-01-31 16:11:37,119 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 16:11:37,119 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 16:11:37,119 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 16:11:37,119 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 16:11:37,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([447] L45-1-->L50: Formula: (let ((.cse0 (= (mod (+ v_thread1Thread1of1ForFork2_~_argptr.base_31 v_thread1Thread1of1ForFork2_~_argptr.offset_31) 4294967296) 0))) (and .cse0 (let ((.cse1 (mod v_~N~0_168 4294967296))) (or (and (= v_~p~0_133 v_~p~0_134) (= v_~N~0_168 v_~N~0_167) (= |v_thread1Thread1of1ForFork2_#t~post1_6| |v_thread1Thread1of1ForFork2_#t~post1_5|) (<= .cse1 0)) (and (not (= .cse1 0)) .cse0 (< 0 .cse1) (<= 1 .cse1) (= v_~N~0_168 (+ v_~N~0_167 1)) (= v_~p~0_133 (+ v_~p~0_134 v_~M~0_88))))) (<= (mod v_~N~0_167 4294967296) 4294967294))) InVars {~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_5|, ~p~0=v_~p~0_134, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_168, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} OutVars{~M~0=v_~M~0_88, thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_6|, ~p~0=v_~p~0_133, thread1Thread1of1ForFork2_~_argptr.base=v_thread1Thread1of1ForFork2_~_argptr.base_31, ~N~0=v_~N~0_167, thread1Thread1of1ForFork2_~_argptr.offset=v_thread1Thread1of1ForFork2_~_argptr.offset_31} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~p~0, ~N~0][242], [Black: 130#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 32#L79-3true, Black: 133#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 129#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 153#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))), Black: 144#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 149#true, 749#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 152#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 767#true, 125#(and (= thread3Thread1of1ForFork1_~_argptr.offset 0) (= |thread3Thread1of1ForFork1_#in~_argptr.base| 0) (= thread3Thread1of1ForFork1_~_argptr.base 0) (= |thread3Thread1of1ForFork1_#in~_argptr.offset| 0)), 4#L100-1true, 113#(and (= |thread1Thread1of1ForFork2_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork2_~_argptr.offset 0) (= |thread1Thread1of1ForFork2_#in~_argptr.base| 0) (= thread1Thread1of1ForFork2_~_argptr.base 0)), 319#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), 131#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 451#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 170#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 407#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), 119#(and (= |thread2Thread1of1ForFork0_#in~_argptr.base| 0) (= thread2Thread1of1ForFork0_~_argptr.base 0) (= thread2Thread1of1ForFork0_~_argptr.offset 0) (= |thread2Thread1of1ForFork0_#in~_argptr.offset| 0)), Black: 425#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 300#(< 0 (mod ~L~0 4294967296)), Black: 459#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 167#(= ~N~0 ~L~0), Black: 455#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 445#(and (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), Black: 165#true, Black: 421#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 423#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 409#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 439#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 326#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 405#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 403#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 457#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 447#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 443#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)))), Black: 339#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 435#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 417#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 427#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 449#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 169#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 70#thread2EXITtrue, Black: 453#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 441#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 106#(and (= ~q~0 (* 4294967296 (div ~q~0 4294967296))) (= (* 4294967296 (div ~p~0 4294967296)) ~p~0)), Black: 739#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 751#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 758#true, Black: 737#(or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 747#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), 64#L50true, Black: 764#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 761#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0))]) [2024-01-31 16:11:37,539 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-01-31 16:11:37,539 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 16:11:37,539 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-31 16:11:37,539 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 16:11:37,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([471] L64-1-->L69: Formula: (let ((.cse0 (= (mod (+ v_thread2Thread1of1ForFork0_~_argptr.offset_31 v_thread2Thread1of1ForFork0_~_argptr.base_31) 4294967296) 0))) (and .cse0 (<= (mod v_~N~0_129 4294967296) 4294967293) (let ((.cse1 (mod v_~N~0_130 4294967296))) (or (and .cse0 (= v_~p~0_101 (+ v_~p~0_102 (* 2 v_~M~0_72))) (<= 2 .cse1) (< 1 .cse1) (= v_~N~0_130 (+ v_~N~0_129 2)) (not (= .cse1 0))) (and (<= .cse1 1) (= v_~N~0_129 v_~N~0_130) (= v_~p~0_102 v_~p~0_101)))))) InVars {~p~0=v_~p~0_102, ~N~0=v_~N~0_130, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_31, ~M~0=v_~M~0_72, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_31} OutVars{~p~0=v_~p~0_101, ~N~0=v_~N~0_129, thread2Thread1of1ForFork0_~_argptr.offset=v_thread2Thread1of1ForFork0_~_argptr.offset_31, ~M~0=v_~M~0_72, thread2Thread1of1ForFork0_~_argptr.base=v_thread2Thread1of1ForFork0_~_argptr.base_31} AuxVars[] AssignedVars[~p~0, ~N~0][321], [Black: 130#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), 32#L79-3true, Black: 133#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 129#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), 153#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1))), Black: 144#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 142#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 154#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 149#true, 749#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~q~0 0) (or (< 0 (mod ~L~0 4294967296)) (= ~p~0 0))), Black: 152#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0)), Black: 158#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), 767#true, 52#L45true, 125#(and (= thread3Thread1of1ForFork1_~_argptr.offset 0) (= |thread3Thread1of1ForFork1_#in~_argptr.base| 0) (= thread3Thread1of1ForFork1_~_argptr.base 0) (= |thread3Thread1of1ForFork1_#in~_argptr.offset| 0)), 4#L100-1true, 113#(and (= |thread1Thread1of1ForFork2_#in~_argptr.offset| 0) (= thread1Thread1of1ForFork2_~_argptr.offset 0) (= |thread1Thread1of1ForFork2_#in~_argptr.base| 0) (= thread1Thread1of1ForFork2_~_argptr.base 0)), 319#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), 131#(< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)), Black: 451#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 170#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 407#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), 119#(and (= |thread2Thread1of1ForFork0_#in~_argptr.base| 0) (= thread2Thread1of1ForFork0_~_argptr.base 0) (= thread2Thread1of1ForFork0_~_argptr.offset 0) (= |thread2Thread1of1ForFork0_#in~_argptr.offset| 0)), Black: 425#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 300#(< 0 (mod ~L~0 4294967296)), Black: 459#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 167#(= ~N~0 ~L~0), Black: 455#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 445#(and (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0)), 49#L69true, Black: 165#true, Black: 421#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 423#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 415#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 409#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 439#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 326#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 433#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 405#(and (= (+ ~L~0 1) ~N~0) (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0)), Black: 403#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 457#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 447#(and (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 443#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)))), Black: 339#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 435#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 417#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 427#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 449#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 169#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 453#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 441#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 106#(and (= ~q~0 (* 4294967296 (div ~q~0 4294967296))) (= (* 4294967296 (div ~p~0 4294967296)) ~p~0)), Black: 739#(and (or (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 1)) (= ~p~0 0) (= ~q~0 0)), Black: 751#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), 758#true, Black: 737#(or (< 0 (mod ~q~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 747#(and (not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))) (= ~q~0 0)), Black: 764#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))), Black: 761#(and (or (and (= thread1Thread1of1ForFork2_~cond~0 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296))) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork2_~cond~0 1))) (= ~N~0 ~L~0))]) [2024-01-31 16:11:37,541 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-31 16:11:37,541 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 16:11:37,542 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 16:11:37,542 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-31 16:11:39,789 INFO L124 PetriNetUnfolderBase]: 18815/34726 cut-off events. [2024-01-31 16:11:39,789 INFO L125 PetriNetUnfolderBase]: For 502826/505221 co-relation queries the response was YES. [2024-01-31 16:11:39,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129959 conditions, 34726 events. 18815/34726 cut-off events. For 502826/505221 co-relation queries the response was YES. Maximal size of possible extension queue 1884. Compared 333575 event pairs, 2674 based on Foata normal form. 1115/34846 useless extension candidates. Maximal degree in co-relation 129867. Up to 13204 conditions per place. [2024-01-31 16:11:40,113 INFO L140 encePairwiseOnDemand]: 80/88 looper letters, 584 selfloop transitions, 416 changer transitions 0/1094 dead transitions. [2024-01-31 16:11:40,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 1094 transitions, 12109 flow [2024-01-31 16:11:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:11:40,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:11:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2024-01-31 16:11:40,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5776515151515151 [2024-01-31 16:11:40,116 INFO L175 Difference]: Start difference. First operand has 169 places, 378 transitions, 3586 flow. Second operand 6 states and 305 transitions. [2024-01-31 16:11:40,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 1094 transitions, 12109 flow [2024-01-31 16:11:41,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 1094 transitions, 11880 flow, removed 80 selfloop flow, removed 2 redundant places. [2024-01-31 16:11:41,240 INFO L231 Difference]: Finished difference. Result has 176 places, 767 transitions, 8565 flow [2024-01-31 16:11:41,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=3501, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8565, PETRI_PLACES=176, PETRI_TRANSITIONS=767} [2024-01-31 16:11:41,241 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 88 predicate places. [2024-01-31 16:11:41,241 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 767 transitions, 8565 flow [2024-01-31 16:11:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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 16:11:41,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:41,241 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:41,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-31 16:11:41,242 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:41,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:41,242 INFO L85 PathProgramCache]: Analyzing trace with hash 18699951, now seen corresponding path program 2 times [2024-01-31 16:11:41,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:41,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898711090] [2024-01-31 16:11:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:41,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:41,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898711090] [2024-01-31 16:11:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898711090] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:11:41,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468283148] [2024-01-31 16:11:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:41,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:41,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:41,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:41,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 88 [2024-01-31 16:11:41,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 767 transitions, 8565 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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 16:11:41,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:41,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 88 [2024-01-31 16:11:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:11:48,402 INFO L124 PetriNetUnfolderBase]: 21153/38941 cut-off events. [2024-01-31 16:11:48,402 INFO L125 PetriNetUnfolderBase]: For 584262/586626 co-relation queries the response was YES. [2024-01-31 16:11:48,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173323 conditions, 38941 events. 21153/38941 cut-off events. For 584262/586626 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 381264 event pairs, 5706 based on Foata normal form. 1374/38647 useless extension candidates. Maximal degree in co-relation 173230. Up to 16670 conditions per place. [2024-01-31 16:11:48,986 INFO L140 encePairwiseOnDemand]: 78/88 looper letters, 322 selfloop transitions, 561 changer transitions 1/976 dead transitions. [2024-01-31 16:11:48,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 976 transitions, 12191 flow [2024-01-31 16:11:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 16:11:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 16:11:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2024-01-31 16:11:48,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-01-31 16:11:48,987 INFO L175 Difference]: Start difference. First operand has 176 places, 767 transitions, 8565 flow. Second operand 6 states and 304 transitions. [2024-01-31 16:11:48,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 976 transitions, 12191 flow [2024-01-31 16:11:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 976 transitions, 12151 flow, removed 20 selfloop flow, removed 0 redundant places. [2024-01-31 16:11:50,858 INFO L231 Difference]: Finished difference. Result has 184 places, 885 transitions, 11670 flow [2024-01-31 16:11:50,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=8525, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=441, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11670, PETRI_PLACES=184, PETRI_TRANSITIONS=885} [2024-01-31 16:11:50,859 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 96 predicate places. [2024-01-31 16:11:50,859 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 885 transitions, 11670 flow [2024-01-31 16:11:50,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 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 16:11:50,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:11:50,860 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:11:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-31 16:11:50,860 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:11:50,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:11:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1273841593, now seen corresponding path program 3 times [2024-01-31 16:11:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:11:50,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903666048] [2024-01-31 16:11:50,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:11:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:11:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:11:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:11:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:11:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903666048] [2024-01-31 16:11:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903666048] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:11:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:11:51,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:11:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845076308] [2024-01-31 16:11:51,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:11:51,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:11:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:11:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:11:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:11:51,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:11:51,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 885 transitions, 11670 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 16:11:51,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:11:51,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:11:51,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 16:12:01,594 INFO L124 PetriNetUnfolderBase]: 28996/51619 cut-off events. [2024-01-31 16:12:01,595 INFO L125 PetriNetUnfolderBase]: For 920575/922950 co-relation queries the response was YES. [2024-01-31 16:12:02,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247170 conditions, 51619 events. 28996/51619 cut-off events. For 920575/922950 co-relation queries the response was YES. Maximal size of possible extension queue 2788. Compared 505308 event pairs, 6149 based on Foata normal form. 785/50720 useless extension candidates. Maximal degree in co-relation 247071. Up to 18454 conditions per place. [2024-01-31 16:12:02,778 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 515 selfloop transitions, 706 changer transitions 2/1306 dead transitions. [2024-01-31 16:12:02,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1306 transitions, 19588 flow [2024-01-31 16:12:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 16:12:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 16:12:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2024-01-31 16:12:02,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2024-01-31 16:12:02,780 INFO L175 Difference]: Start difference. First operand has 184 places, 885 transitions, 11670 flow. Second operand 5 states and 266 transitions. [2024-01-31 16:12:02,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1306 transitions, 19588 flow [2024-01-31 16:12:06,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1306 transitions, 18717 flow, removed 24 selfloop flow, removed 2 redundant places. [2024-01-31 16:12:06,534 INFO L231 Difference]: Finished difference. Result has 189 places, 1175 transitions, 17621 flow [2024-01-31 16:12:06,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=11096, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=416, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=17621, PETRI_PLACES=189, PETRI_TRANSITIONS=1175} [2024-01-31 16:12:06,535 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 101 predicate places. [2024-01-31 16:12:06,535 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 1175 transitions, 17621 flow [2024-01-31 16:12:06,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 16:12:06,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 16:12:06,536 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 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 16:12:06,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-31 16:12:06,536 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 65 more)] === [2024-01-31 16:12:06,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 16:12:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash -140382641, now seen corresponding path program 4 times [2024-01-31 16:12:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 16:12:06,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739222796] [2024-01-31 16:12:06,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 16:12:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 16:12:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 16:12:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 16:12:06,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 16:12:06,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739222796] [2024-01-31 16:12:06,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739222796] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 16:12:06,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 16:12:06,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 16:12:06,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619931935] [2024-01-31 16:12:06,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 16:12:06,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 16:12:06,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 16:12:06,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 16:12:06,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 16:12:06,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 88 [2024-01-31 16:12:06,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1175 transitions, 17621 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 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 16:12:06,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 16:12:06,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 88 [2024-01-31 16:12:06,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand