./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.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/bench-exp2x4.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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/bench-exp2x4.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x4.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-dev-3d25acf-m [2024-01-30 14:22:40,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:22:40,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:22:40,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:22:40,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:22:40,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:22:40,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:22:40,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:22:40,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:22:40,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:22:40,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:22:40,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:22:40,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:22:40,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:22:40,846 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:22:40,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:22:40,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:22:40,846 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:22:40,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:22:40,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:22:40,848 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:22:40,848 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:22:40,848 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:22:40,849 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:22:40,849 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:22:40,849 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:22:40,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:22:40,849 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:22:40,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:22:40,850 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:22:40,851 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:22:40,851 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:22:40,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:40,851 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:22:40,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:22:40,852 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:22:40,853 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:22:40,853 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:22:40,853 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-30 14:22:41,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:22:41,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:22:41,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:22:41,182 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:22:41,182 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:22:41,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-30 14:22:42,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:22:42,419 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:22:42,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-01-30 14:22:42,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0f66397/7c5d71d916d942a2b40eee8a8589e984/FLAG27686fc6b [2024-01-30 14:22:42,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee0f66397/7c5d71d916d942a2b40eee8a8589e984 [2024-01-30 14:22:42,447 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:22:42,447 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:22:42,449 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/bench-exp2x4.wvr.yml/witness.yml [2024-01-30 14:22:42,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:22:42,544 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:22:42,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:42,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:22:42,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:22:42,551 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:42" (1/2) ... [2024-01-30 14:22:42,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1717c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:42, skipping insertion in model container [2024-01-30 14:22:42,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:42" (1/2) ... [2024-01-30 14:22:42,553 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f31c103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:42, skipping insertion in model container [2024-01-30 14:22:42,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:42" (2/2) ... [2024-01-30 14:22:42,554 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c1717c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42, skipping insertion in model container [2024-01-30 14:22:42,554 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:42" (2/2) ... [2024-01-30 14:22:42,554 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:22:42,575 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:22:42,579 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L41] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,579 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,579 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,579 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Loop invariant at [L47-L50] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L80-L80] (x4 == 0U) && (n == 0U) [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L81-L81] n == 0U [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L79-L79] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:42,580 INFO L98 nessWitnessExtractor]: Location invariant before [L40-L40] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L78-L78] (((x2 == 0U) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L49-L49] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L48-L48] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L61-L61] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L43-L43] (n == 0U) && ((unsigned long )_argptr == 0UL) [2024-01-30 14:22:42,581 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,582 INFO L98 nessWitnessExtractor]: Loop invariant at [L65-L68] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,582 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] (((((((((0LL - (long long )x1) + (long long )x3 >= 0LL) && ((long long )x1 + (long long )x3 >= 0LL)) && ((0LL - (long long )x1) - (long long )x3 >= 0LL)) && ((long long )x1 - (long long )x3 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:42,582 INFO L98 nessWitnessExtractor]: Loop invariant at [L56-L59] (unsigned long )_argptr == 0UL [2024-01-30 14:22:42,603 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:22:42,719 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/bench-exp2x4.wvr.c[2361,2374] [2024-01-30 14:22:42,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:42,730 INFO L202 MainTranslator]: Completed pre-run 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-30 14:22:42,772 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/bench-exp2x4.wvr.c[2361,2374] [2024-01-30 14:22:42,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:42,783 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:22:42,785 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42 WrapperNode [2024-01-30 14:22:42,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:42,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:42,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:22:42,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:22:42,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,823 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-01-30 14:22:42,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:42,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:22:42,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:22:42,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:22:42,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,873 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-30 14:22:42,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:22:42,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:22:42,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:22:42,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:22:42,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (1/1) ... [2024-01-30 14:22:42,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:43,051 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-30 14:22:43,053 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-30 14:22:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:22:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:22:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:22:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:22:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:22:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-30 14:22:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-30 14:22:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-30 14:22:43,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:22:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:22:43,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:22:43,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:22:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:22:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-30 14:22:43,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:22:43,082 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:22:43,212 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:22:43,214 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:22:43,515 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:22:43,515 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:22:43,630 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:22:43,630 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-30 14:22:43,631 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:43 BoogieIcfgContainer [2024-01-30 14:22:43,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:22:43,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:22:43,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:22:43,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:22:43,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:22:42" (1/4) ... [2024-01-30 14:22:43,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3599379f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:22:43, skipping insertion in model container [2024-01-30 14:22:43,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:42" (2/4) ... [2024-01-30 14:22:43,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3599379f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:43, skipping insertion in model container [2024-01-30 14:22:43,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:42" (3/4) ... [2024-01-30 14:22:43,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3599379f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:43, skipping insertion in model container [2024-01-30 14:22:43,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:43" (4/4) ... [2024-01-30 14:22:43,638 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-01-30 14:22:43,650 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:22:43,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-01-30 14:22:43,651 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:22:43,723 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-30 14:22:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 85 transitions, 198 flow [2024-01-30 14:22:43,795 INFO L124 PetriNetUnfolderBase]: 4/81 cut-off events. [2024-01-30 14:22:43,795 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-30 14:22:43,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 81 events. 4/81 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 225 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2024-01-30 14:22:43,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 85 transitions, 198 flow [2024-01-30 14:22:43,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 80 transitions, 184 flow [2024-01-30 14:22:43,808 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:22:43,813 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;@1c7ae5da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:22:43,813 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-01-30 14:22:43,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:22:43,815 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:22:43,815 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:43,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:43,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:22:43,816 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:43,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 12140, now seen corresponding path program 1 times [2024-01-30 14:22:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:43,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877418197] [2024-01-30 14:22:43,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:43,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:44,258 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-30 14:22:44,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:44,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877418197] [2024-01-30 14:22:44,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877418197] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:44,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:44,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:22:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813295869] [2024-01-30 14:22:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:44,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:44,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 85 [2024-01-30 14:22:44,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-30 14:22:44,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:44,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 85 [2024-01-30 14:22:44,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:45,776 INFO L124 PetriNetUnfolderBase]: 14122/20670 cut-off events. [2024-01-30 14:22:45,776 INFO L125 PetriNetUnfolderBase]: For 802/802 co-relation queries the response was YES. [2024-01-30 14:22:45,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39144 conditions, 20670 events. 14122/20670 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 139874 event pairs, 9765 based on Foata normal form. 0/14729 useless extension candidates. Maximal degree in co-relation 34430. Up to 17691 conditions per place. [2024-01-30 14:22:45,901 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 44 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-30 14:22:45,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 274 flow [2024-01-30 14:22:45,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2024-01-30 14:22:45,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196078431372549 [2024-01-30 14:22:45,912 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 184 flow. Second operand 3 states and 158 transitions. [2024-01-30 14:22:45,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 274 flow [2024-01-30 14:22:45,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 258 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-30 14:22:45,935 INFO L231 Difference]: Finished difference. Result has 82 places, 79 transitions, 170 flow [2024-01-30 14:22:45,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2024-01-30 14:22:45,940 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2024-01-30 14:22:45,940 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 170 flow [2024-01-30 14:22:45,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-30 14:22:45,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:45,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:22:45,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:22:45,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:45,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:45,942 INFO L85 PathProgramCache]: Analyzing trace with hash 376713, now seen corresponding path program 1 times [2024-01-30 14:22:45,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927827555] [2024-01-30 14:22:45,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:45,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:45,990 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-30 14:22:45,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:45,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927827555] [2024-01-30 14:22:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927827555] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593590319] [2024-01-30 14:22:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:45,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:45,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:45,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:46,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 85 [2024-01-30 14:22:46,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-30 14:22:46,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:46,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 85 [2024-01-30 14:22:46,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:47,248 INFO L124 PetriNetUnfolderBase]: 14122/20669 cut-off events. [2024-01-30 14:22:47,248 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-30 14:22:47,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38623 conditions, 20669 events. 14122/20669 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 139813 event pairs, 9765 based on Foata normal form. 0/14729 useless extension candidates. Maximal degree in co-relation 38614. Up to 17689 conditions per place. [2024-01-30 14:22:47,353 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 43 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-01-30 14:22:47,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 258 flow [2024-01-30 14:22:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:47,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-01-30 14:22:47,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2024-01-30 14:22:47,359 INFO L175 Difference]: Start difference. First operand has 82 places, 79 transitions, 170 flow. Second operand 3 states and 160 transitions. [2024-01-30 14:22:47,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 258 flow [2024-01-30 14:22:47,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 78 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:47,362 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 168 flow [2024-01-30 14:22:47,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2024-01-30 14:22:47,362 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2024-01-30 14:22:47,363 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 168 flow [2024-01-30 14:22:47,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-30 14:22:47,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:47,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:22:47,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:22:47,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:47,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 11678525, now seen corresponding path program 1 times [2024-01-30 14:22:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751680552] [2024-01-30 14:22:47,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:47,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:47,409 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-30 14:22:47,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:47,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751680552] [2024-01-30 14:22:47,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751680552] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:47,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:47,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:47,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596618073] [2024-01-30 14:22:47,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:47,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:47,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:47,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:47,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:47,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 85 [2024-01-30 14:22:47,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-30 14:22:47,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:47,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 85 [2024-01-30 14:22:47,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:48,508 INFO L124 PetriNetUnfolderBase]: 14122/20668 cut-off events. [2024-01-30 14:22:48,518 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-30 14:22:48,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38621 conditions, 20668 events. 14122/20668 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 139849 event pairs, 9765 based on Foata normal form. 0/14729 useless extension candidates. Maximal degree in co-relation 38610. Up to 17687 conditions per place. [2024-01-30 14:22:48,614 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 42 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-01-30 14:22:48,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 77 transitions, 254 flow [2024-01-30 14:22:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:48,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-01-30 14:22:48,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2024-01-30 14:22:48,616 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 168 flow. Second operand 3 states and 162 transitions. [2024-01-30 14:22:48,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 77 transitions, 254 flow [2024-01-30 14:22:48,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:48,618 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 166 flow [2024-01-30 14:22:48,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-01-30 14:22:48,618 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -9 predicate places. [2024-01-30 14:22:48,619 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 166 flow [2024-01-30 14:22:48,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-30 14:22:48,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:48,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:22:48,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:22:48,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:48,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 362034641, now seen corresponding path program 1 times [2024-01-30 14:22:48,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222468718] [2024-01-30 14:22:48,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:48,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:48,649 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-30 14:22:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222468718] [2024-01-30 14:22:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222468718] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337616822] [2024-01-30 14:22:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:48,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:48,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 85 [2024-01-30 14:22:48,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:48,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:48,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 85 [2024-01-30 14:22:48,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:49,746 INFO L124 PetriNetUnfolderBase]: 14122/20667 cut-off events. [2024-01-30 14:22:49,747 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-30 14:22:49,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38619 conditions, 20667 events. 14122/20667 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 139786 event pairs, 9765 based on Foata normal form. 0/14729 useless extension candidates. Maximal degree in co-relation 38606. Up to 17685 conditions per place. [2024-01-30 14:22:49,830 INFO L140 encePairwiseOnDemand]: 82/85 looper letters, 41 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-30 14:22:49,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 76 transitions, 250 flow [2024-01-30 14:22:49,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2024-01-30 14:22:49,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6431372549019608 [2024-01-30 14:22:49,831 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 166 flow. Second operand 3 states and 164 transitions. [2024-01-30 14:22:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 76 transitions, 250 flow [2024-01-30 14:22:49,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 76 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:49,833 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 164 flow [2024-01-30 14:22:49,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2024-01-30 14:22:49,834 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -10 predicate places. [2024-01-30 14:22:49,834 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 164 flow [2024-01-30 14:22:49,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:49,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:49,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:22:49,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:22:49,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:49,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:49,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1661827591, now seen corresponding path program 1 times [2024-01-30 14:22:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:49,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043958424] [2024-01-30 14:22:49,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:49,853 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-30 14:22:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043958424] [2024-01-30 14:22:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043958424] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470206315] [2024-01-30 14:22:49,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:49,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:49,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 85 [2024-01-30 14:22:49,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-30 14:22:49,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:49,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 85 [2024-01-30 14:22:49,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:50,651 INFO L124 PetriNetUnfolderBase]: 13150/19229 cut-off events. [2024-01-30 14:22:50,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:50,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36217 conditions, 19229 events. 13150/19229 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1146. Compared 129111 event pairs, 7043 based on Foata normal form. 0/14514 useless extension candidates. Maximal degree in co-relation 36202. Up to 12975 conditions per place. [2024-01-30 14:22:50,737 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 58 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2024-01-30 14:22:50,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 325 flow [2024-01-30 14:22:50,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:50,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2024-01-30 14:22:50,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7372549019607844 [2024-01-30 14:22:50,739 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 164 flow. Second operand 3 states and 188 transitions. [2024-01-30 14:22:50,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 325 flow [2024-01-30 14:22:50,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:50,741 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 173 flow [2024-01-30 14:22:50,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2024-01-30 14:22:50,742 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -10 predicate places. [2024-01-30 14:22:50,742 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 173 flow [2024-01-30 14:22:50,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-30 14:22:50,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:50,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:50,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:22:50,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:50,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 582743316, now seen corresponding path program 1 times [2024-01-30 14:22:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780975525] [2024-01-30 14:22:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:50,806 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-30 14:22:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780975525] [2024-01-30 14:22:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780975525] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794068504] [2024-01-30 14:22:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:50,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:50,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 85 [2024-01-30 14:22:50,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-30 14:22:50,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:50,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 85 [2024-01-30 14:22:50,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:51,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([422] L47-4-->L48: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_6 4294967296)) InVars {~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_6, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 17#L48true, 20#L66true, 6#L57true, 31#L90-1true, 109#true, 87#$Ultimate##0true]) [2024-01-30 14:22:51,587 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-30 14:22:51,587 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:51,587 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:51,588 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:51,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][70], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 18#L38true, 15#thread3EXITtrue, 49#L67true, 31#L90-1true, 109#true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,662 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:51,663 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:51,663 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:51,663 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:51,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 17#L48true, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L66true, 70#L56-5true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,706 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:51,706 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:51,706 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:51,706 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:51,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 20#L66true, 15#thread3EXITtrue, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,711 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,711 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,711 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,711 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:51,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][70], [65#L38-5true, Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 15#thread3EXITtrue, 49#L67true, 31#L90-1true, 109#true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,745 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:51,745 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,745 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,745 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,746 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 20#L66true, 15#thread3EXITtrue, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,746 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:51,746 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,746 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,746 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,746 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:51,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][70], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 37#L40true, 15#thread3EXITtrue, 49#L67true, 31#L90-1true, 109#true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,755 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-30 14:22:51,755 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:51,755 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:51,756 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:51,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][70], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 15#thread3EXITtrue, 49#L67true, 32#L38-3true, 31#L90-1true, 109#true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,773 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-01-30 14:22:51,773 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:51,774 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:51,774 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:51,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 51#L47-5true, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,785 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:51,785 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:51,785 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:51,785 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:51,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 81#L49true]) [2024-01-30 14:22:51,792 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:51,792 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:51,792 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:51,792 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 74#thread2EXITtrue, 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,793 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:51,793 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:51,794 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,794 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:51,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][23], [60#thread1EXITtrue, 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 20#L66true, 31#L90-1true, 6#L57true, 7#L47-3true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:51,799 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-30 14:22:51,799 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:51,799 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:51,799 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:51,803 INFO L124 PetriNetUnfolderBase]: 11291/16741 cut-off events. [2024-01-30 14:22:51,803 INFO L125 PetriNetUnfolderBase]: For 1476/2494 co-relation queries the response was YES. [2024-01-30 14:22:51,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32121 conditions, 16741 events. 11291/16741 cut-off events. For 1476/2494 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 115959 event pairs, 1136 based on Foata normal form. 960/16503 useless extension candidates. Maximal degree in co-relation 23190. Up to 12482 conditions per place. [2024-01-30 14:22:51,930 INFO L140 encePairwiseOnDemand]: 79/85 looper letters, 56 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2024-01-30 14:22:51,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 322 flow [2024-01-30 14:22:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2024-01-30 14:22:51,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2024-01-30 14:22:51,932 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 173 flow. Second operand 4 states and 226 transitions. [2024-01-30 14:22:51,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 322 flow [2024-01-30 14:22:51,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 90 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:51,988 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 163 flow [2024-01-30 14:22:51,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-01-30 14:22:51,989 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2024-01-30 14:22:51,989 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 163 flow [2024-01-30 14:22:51,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-30 14:22:51,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:51,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:51,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:22:51,990 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:51,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1668919465, now seen corresponding path program 1 times [2024-01-30 14:22:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393908304] [2024-01-30 14:22:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:52,081 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-30 14:22:52,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:52,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393908304] [2024-01-30 14:22:52,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393908304] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:52,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:52,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168572036] [2024-01-30 14:22:52,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:52,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:52,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 85 [2024-01-30 14:22:52,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-30 14:22:52,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:52,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 85 [2024-01-30 14:22:52,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:52,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 6#L57true, 56#L89-4true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,693 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,693 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-30 14:22:52,693 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-01-30 14:22:52,693 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 6#L57true, 56#L89-4true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,771 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,771 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-30 14:22:52,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-30 14:22:52,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 31#L90-1true, 6#L57true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,774 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,774 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,775 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,775 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-30 14:22:52,850 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 6#L57true, 56#L89-4true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,851 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,851 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 31#L90-1true, 6#L57true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,852 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,852 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,852 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,852 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][39], [60#thread1EXITtrue, 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 15#thread3EXITtrue, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,854 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [65#L38-5true, Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#thread3EXITtrue, 49#L67true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,855 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,855 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-30 14:22:52,856 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 32#L38-3true, 49#L67true, 70#L56-5true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,874 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,874 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,874 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,874 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 65#L38-5true, 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,900 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,900 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-01-30 14:22:52,900 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,901 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 115#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 31#L90-1true, 6#L57true, 87#$Ultimate##0true]) [2024-01-30 14:22:52,916 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,916 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,916 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,916 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 37#L40true, 15#thread3EXITtrue, 49#L67true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,917 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:52,917 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,917 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,917 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([414] L38-5-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod (+ v_thread1Thread1of1ForFork1_~_argptr.base_13 v_thread1Thread1of1ForFork1_~_argptr.offset_13) 4294967296) 0) (= (mod v_~n~0_23 4294967296) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~_argptr.base=v_thread1Thread1of1ForFork1_~_argptr.base_13, ~n~0=v_~n~0_23, thread1Thread1of1ForFork1_~_argptr.offset=v_thread1Thread1of1ForFork1_~_argptr.offset_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][39], [60#thread1EXITtrue, 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#thread3EXITtrue, 20#L66true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,919 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:52,919 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,919 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,919 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [65#L38-5true, Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#thread3EXITtrue, 49#L67true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,920 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:52,920 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,920 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-30 14:22:52,920 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 32#L38-3true, 49#L67true, 70#L56-5true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,932 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,932 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,933 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,933 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 37#L40true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,934 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,934 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,934 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,935 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#thread3EXITtrue, 49#L67true, 32#L38-3true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,935 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,935 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,935 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,935 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 65#L38-5true, 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,943 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,943 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,944 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,944 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [65#L38-5true, Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,953 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,953 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-01-30 14:22:52,954 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,954 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 37#L40true, 15#thread3EXITtrue, 49#L67true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,962 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-30 14:22:52,962 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,962 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:52,963 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-01-30 14:22:52,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 37#L40true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,965 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,966 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,966 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,966 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 37#L40true, 20#L66true, 6#L57true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,972 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,973 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,973 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,973 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([451] L66-->L67: Formula: (and (= (* v_~x4~0_20 2) v_~x4~0_19) (= 0 (mod (+ v_thread4Thread1of1ForFork2_~_argptr.base_9 v_thread4Thread1of1ForFork2_~_argptr.offset_9) 4294967296))) InVars {thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_20, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} OutVars{thread4Thread1of1ForFork2_~_argptr.offset=v_thread4Thread1of1ForFork2_~_argptr.offset_9, ~x4~0=v_~x4~0_19, thread4Thread1of1ForFork2_~_argptr.base=v_thread4Thread1of1ForFork2_~_argptr.base_9} AuxVars[] AssignedVars[~x4~0][66], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 15#thread3EXITtrue, 32#L38-3true, 49#L67true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,973 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,973 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 32#L38-3true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,974 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,974 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,975 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,975 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [65#L38-5true, Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,979 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,979 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 65#L38-5true, 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,980 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-01-30 14:22:52,980 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-01-30 14:22:52,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 37#L40true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,990 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,990 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,990 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,991 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 37#L40true, 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,991 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,991 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 32#L38-3true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,992 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,992 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([435] L56-4-->L57: Formula: (< (mod v_~x3~0_1 4294967296) (mod v_~n~0_7 4294967296)) InVars {~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} OutVars{~x3~0=v_~x3~0_1, ~n~0=v_~n~0_7} AuxVars[] AssignedVars[][44], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 17#L48true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 32#L38-3true, 6#L57true, 31#L90-1true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,996 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:52,996 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-30 14:22:52,996 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,996 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:52,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 65#L38-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 74#thread2EXITtrue, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:52,998 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,998 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-01-30 14:22:52,998 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:52,998 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-01-30 14:22:53,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 37#L40true, 20#L66true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:53,004 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,004 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,004 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,004 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 32#L38-3true, 6#L57true, 56#L89-4true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:53,004 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,005 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,005 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,005 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 51#L47-5true, 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 20#L66true, 32#L38-3true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:53,005 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,005 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,006 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-01-30 14:22:53,006 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-01-30 14:22:53,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([448] L65-4-->L66: Formula: (< (mod v_~x4~0_4 4294967296) (mod v_~n~0_10 4294967296)) InVars {~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} OutVars{~n~0=v_~n~0_10, ~x4~0=v_~x4~0_4} AuxVars[] AssignedVars[][59], [Black: 111#(= ~n~0 (* (div ~n~0 4294967296) 4294967296)), 124#(and (= thread2Thread1of1ForFork3_~_argptr.offset 0) (= thread2Thread1of1ForFork3_~_argptr.base 0) (= |thread2Thread1of1ForFork3_#in~_argptr.offset| 0) (= |thread2Thread1of1ForFork3_#in~_argptr.base| 0)), 74#thread2EXITtrue, 20#L66true, 32#L38-3true, 31#L90-1true, 6#L57true, 118#(and (= |thread1Thread1of1ForFork1_#in~_argptr.base| 0) (= thread1Thread1of1ForFork1_~_argptr.base 0) (= thread1Thread1of1ForFork1_~_argptr.offset 0) (= |thread1Thread1of1ForFork1_#in~_argptr.offset| 0))]) [2024-01-30 14:22:53,009 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-01-30 14:22:53,009 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:53,009 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-01-30 14:22:53,010 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-01-30 14:22:53,013 INFO L124 PetriNetUnfolderBase]: 11216/17777 cut-off events. [2024-01-30 14:22:53,013 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2024-01-30 14:22:53,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32695 conditions, 17777 events. 11216/17777 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 134080 event pairs, 4908 based on Foata normal form. 876/16936 useless extension candidates. Maximal degree in co-relation 32672. Up to 12160 conditions per place. [2024-01-30 14:22:53,134 INFO L140 encePairwiseOnDemand]: 78/85 looper letters, 60 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-01-30 14:22:53,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 89 transitions, 328 flow [2024-01-30 14:22:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2024-01-30 14:22:53,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6676470588235294 [2024-01-30 14:22:53,136 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 163 flow. Second operand 4 states and 227 transitions. [2024-01-30 14:22:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 89 transitions, 328 flow [2024-01-30 14:22:53,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 89 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:53,138 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 154 flow [2024-01-30 14:22:53,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=85, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2024-01-30 14:22:53,139 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -17 predicate places. [2024-01-30 14:22:53,139 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 154 flow [2024-01-30 14:22:53,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 4 states have internal predecessors, (171), 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-30 14:22:53,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:53,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:53,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:22:53,140 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (and 47 more)] === [2024-01-30 14:22:53,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:53,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1670592280, now seen corresponding path program 1 times [2024-01-30 14:22:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:53,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975339661] [2024-01-30 14:22:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:53,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:53,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:22:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:22:53,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:22:53,173 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:22:53,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 50 remaining) [2024-01-30 14:22:53,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 50 remaining) [2024-01-30 14:22:53,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 50 remaining) [2024-01-30 14:22:53,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 50 remaining) [2024-01-30 14:22:53,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 50 remaining) [2024-01-30 14:22:53,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 50 remaining) [2024-01-30 14:22:53,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (28 of 50 remaining) [2024-01-30 14:22:53,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 50 remaining) [2024-01-30 14:22:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 50 remaining) [2024-01-30 14:22:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 50 remaining) [2024-01-30 14:22:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 50 remaining) [2024-01-30 14:22:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 50 remaining) [2024-01-30 14:22:53,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 50 remaining) [2024-01-30 14:22:53,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 50 remaining) [2024-01-30 14:22:53,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 50 remaining) [2024-01-30 14:22:53,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 50 remaining) [2024-01-30 14:22:53,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 50 remaining) [2024-01-30 14:22:53,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 50 remaining) [2024-01-30 14:22:53,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 50 remaining) [2024-01-30 14:22:53,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:22:53,183 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:53,188 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:22:53,188 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:22:53,215 INFO L503 ceAbstractionStarter]: Automizer considered 25 witness invariants [2024-01-30 14:22:53,215 INFO L504 ceAbstractionStarter]: WitnessConsidered=25 [2024-01-30 14:22:53,216 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:22:53 BasicIcfg [2024-01-30 14:22:53,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:22:53,217 INFO L158 Benchmark]: Toolchain (without parser) took 10673.05ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 79.8MB in the beginning and 6.0GB in the end (delta: -6.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-30 14:22:53,217 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:53,217 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:22:53,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.48ms. Allocated memory is still 159.4MB. Free memory was 79.6MB in the beginning and 64.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-30 14:22:53,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.78ms. Allocated memory is still 159.4MB. Free memory was 64.0MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:22:53,220 INFO L158 Benchmark]: Boogie Preprocessor took 77.60ms. Allocated memory is still 159.4MB. Free memory was 62.1MB in the beginning and 128.4MB in the end (delta: -66.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-01-30 14:22:53,220 INFO L158 Benchmark]: RCFGBuilder took 729.72ms. Allocated memory is still 159.4MB. Free memory was 128.4MB in the beginning and 96.3MB in the end (delta: 32.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-01-30 14:22:53,220 INFO L158 Benchmark]: TraceAbstraction took 9583.84ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 95.7MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-30 14:22:53,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 130.0MB in the beginning and 129.8MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.48ms. Allocated memory is still 159.4MB. Free memory was 79.6MB in the beginning and 64.0MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.78ms. Allocated memory is still 159.4MB. Free memory was 64.0MB in the beginning and 62.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.60ms. Allocated memory is still 159.4MB. Free memory was 62.1MB in the beginning and 128.4MB in the end (delta: -66.3MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * RCFGBuilder took 729.72ms. Allocated memory is still 159.4MB. Free memory was 128.4MB in the beginning and 96.3MB in the end (delta: 32.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9583.84ms. Allocated memory was 159.4MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 95.7MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L35] 0 unsigned int x1, x2, x3, x4, n; [L74] 0 pthread_t t1, t2, t3, t4; VAL [n=0, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=0, x2=0, x3=0, x4=0] [L77] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[x1]]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[x1]],CastExpression[ACSLType[long long],IdentifierExpression[x3]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[x1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L77] 0 x1 = __VERIFIER_nondet_uint() [L78] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x2],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L78] 0 x2 = __VERIFIER_nondet_uint() [L79] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x3],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L79] 0 x3 = __VERIFIER_nondet_uint() [L80] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[x4],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]]] [L80] 0 x4 = __VERIFIER_nondet_uint() [L81] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]]]] [L81] 0 n = __VERIFIER_nondet_uint() [L84] CALL 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L32] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not( x1 == x2 && x1 > 0 && x3 == x4 && x3 > 0 ) [L86] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, t1={5:0}, t2={3:0}, t3={6:0}, t4={7:0}, x1=1, x2=1, x3=1, x4=1] [L38] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, x1=1, x2=1, x3=1, x4=1] [L38] COND FALSE 1 !(x1 < n) VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] [L43] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0U]],BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]]] VAL [_argptr={0:0}, _argptr={0:0}, n=1, x1=1, x2=1, x3=1, x4=1] - UnprovableResult [Line: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 61]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 79]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 96]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 88]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 89]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 138 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 41 mSDtfsCounter, 650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:22:53,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE