./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:52:54,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:52:54,431 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:52:54,438 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:52:54,439 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:52:54,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:52:54,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:52:54,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:52:54,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:52:54,485 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:52:54,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:52:54,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:52:54,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:52:54,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:52:54,487 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:52:54,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:52:54,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:52:54,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:52:54,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:52:54,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:52:54,490 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:52:54,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:52:54,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:52:54,492 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:52:54,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:52:54,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:52:54,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:52:54,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:52:54,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:52:54,493 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-11-28 03:52:54,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:52:54,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:52:54,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:52:54,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:52:54,885 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:52:54,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-28 03:52:58,600 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/data/101443eb2/d32e90fdd5d14b468a973e54525aa33f/FLAG74b199fc8 [2024-11-28 03:52:58,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:52:58,966 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-28 03:52:58,978 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/data/101443eb2/d32e90fdd5d14b468a973e54525aa33f/FLAG74b199fc8 [2024-11-28 03:52:59,192 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/data/101443eb2/d32e90fdd5d14b468a973e54525aa33f [2024-11-28 03:52:59,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:52:59,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:52:59,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:52:59,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:52:59,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:52:59,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43594979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59, skipping insertion in model container [2024-11-28 03:52:59,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:52:59,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:52:59,566 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:52:59,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:52:59,639 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:52:59,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59 WrapperNode [2024-11-28 03:52:59,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:52:59,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:52:59,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:52:59,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:52:59,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,708 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-28 03:52:59,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:52:59,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:52:59,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:52:59,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:52:59,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 03:52:59,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:52:59,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:52:59,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:52:59,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:52:59,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (1/1) ... [2024-11-28 03:52:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:52:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:52:59,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:52:59,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:52:59,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:52:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 03:52:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 03:52:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 03:52:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 03:52:59,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 03:52:59,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 03:52:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:52:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:52:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:52:59,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:52:59,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:52:59,905 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:53:00,061 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:53:00,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:53:00,435 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:53:00,435 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:53:00,702 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:53:00,702 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:53:00,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:00 BoogieIcfgContainer [2024-11-28 03:53:00,703 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:53:00,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:53:00,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:53:00,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:53:00,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:52:59" (1/3) ... [2024-11-28 03:53:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbd9fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:53:00, skipping insertion in model container [2024-11-28 03:53:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:52:59" (2/3) ... [2024-11-28 03:53:00,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbd9fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:53:00, skipping insertion in model container [2024-11-28 03:53:00,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:53:00" (3/3) ... [2024-11-28 03:53:00,720 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-28 03:53:00,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:53:00,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 35 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2024-11-28 03:53:00,746 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:53:00,878 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 03:53:00,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2024-11-28 03:53:00,987 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-11-28 03:53:00,993 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:53:01,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-28 03:53:01,003 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2024-11-28 03:53:01,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-11-28 03:53:01,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:53:01,056 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@25cf2e36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:53:01,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-28 03:53:01,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:53:01,077 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-11-28 03:53:01,078 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:53:01,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:01,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:01,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:01,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1981272531, now seen corresponding path program 1 times [2024-11-28 03:53:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470804956] [2024-11-28 03:53:01,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:53:01,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:53:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:02,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470804956] [2024-11-28 03:53:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470804956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:02,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:02,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:53:02,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941048397] [2024-11-28 03:53:02,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:02,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:53:02,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:02,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:53:02,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:53:02,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-28 03:53:02,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-28 03:53:02,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:02,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-28 03:53:02,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:02,940 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-11-28 03:53:02,940 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-28 03:53:02,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3360 event pairs, 26 based on Foata normal form. 21/660 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-11-28 03:53:02,952 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-28 03:53:02,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-11-28 03:53:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:53:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:53:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-28 03:53:02,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-11-28 03:53:02,974 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 100 transitions. [2024-11-28 03:53:02,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-11-28 03:53:02,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:53:02,989 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-11-28 03:53:02,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-11-28 03:53:02,998 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-11-28 03:53:02,998 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-11-28 03:53:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-11-28 03:53:02,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:02,999 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:53:03,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:03,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:03,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1513118354, now seen corresponding path program 1 times [2024-11-28 03:53:03,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:03,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399696969] [2024-11-28 03:53:03,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:53:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:53:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-28 03:53:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399696969] [2024-11-28 03:53:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399696969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:03,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:03,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:53:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862642971] [2024-11-28 03:53:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:53:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:03,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:53:03,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:53:03,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-28 03:53:03,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-11-28 03:53:03,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:03,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-28 03:53:03,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:04,173 INFO L124 PetriNetUnfolderBase]: 498/815 cut-off events. [2024-11-28 03:53:04,173 INFO L125 PetriNetUnfolderBase]: For 258/314 co-relation queries the response was YES. [2024-11-28 03:53:04,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1869 conditions, 815 events. 498/815 cut-off events. For 258/314 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3770 event pairs, 52 based on Foata normal form. 82/872 useless extension candidates. Maximal degree in co-relation 1568. Up to 589 conditions per place. [2024-11-28 03:53:04,193 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 44 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-28 03:53:04,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 63 transitions, 292 flow [2024-11-28 03:53:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:53:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:53:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-28 03:53:04,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-11-28 03:53:04,196 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 4 states and 103 transitions. [2024-11-28 03:53:04,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 63 transitions, 292 flow [2024-11-28 03:53:04,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 63 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:53:04,201 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 154 flow [2024-11-28 03:53:04,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2024-11-28 03:53:04,203 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-11-28 03:53:04,205 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 154 flow [2024-11-28 03:53:04,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-11-28 03:53:04,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:04,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:04,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:53:04,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:04,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:04,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1606497104, now seen corresponding path program 2 times [2024-11-28 03:53:04,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:04,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557518172] [2024-11-28 03:53:04,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:53:04,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:04,258 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:53:04,258 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:53:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557518172] [2024-11-28 03:53:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557518172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:04,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:53:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944111401] [2024-11-28 03:53:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:53:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:53:04,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:53:04,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-28 03:53:04,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-11-28 03:53:04,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:04,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-28 03:53:04,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:06,068 INFO L124 PetriNetUnfolderBase]: 1596/2427 cut-off events. [2024-11-28 03:53:06,069 INFO L125 PetriNetUnfolderBase]: For 1363/1377 co-relation queries the response was YES. [2024-11-28 03:53:06,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6301 conditions, 2427 events. 1596/2427 cut-off events. For 1363/1377 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 12644 event pairs, 137 based on Foata normal form. 97/2494 useless extension candidates. Maximal degree in co-relation 2403. Up to 818 conditions per place. [2024-11-28 03:53:06,100 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 94 selfloop transitions, 40 changer transitions 0/142 dead transitions. [2024-11-28 03:53:06,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 142 transitions, 763 flow [2024-11-28 03:53:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:53:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:53:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 236 transitions. [2024-11-28 03:53:06,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2024-11-28 03:53:06,109 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 154 flow. Second operand 10 states and 236 transitions. [2024-11-28 03:53:06,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 142 transitions, 763 flow [2024-11-28 03:53:06,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 142 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:53:06,119 INFO L231 Difference]: Finished difference. Result has 59 places, 76 transitions, 491 flow [2024-11-28 03:53:06,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=491, PETRI_PLACES=59, PETRI_TRANSITIONS=76} [2024-11-28 03:53:06,121 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2024-11-28 03:53:06,121 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 76 transitions, 491 flow [2024-11-28 03:53:06,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-11-28 03:53:06,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:06,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:06,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:53:06,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:06,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:06,123 INFO L85 PathProgramCache]: Analyzing trace with hash -818770818, now seen corresponding path program 3 times [2024-11-28 03:53:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:06,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009624022] [2024-11-28 03:53:06,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:53:06,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:06,169 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 03:53:06,172 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:53:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009624022] [2024-11-28 03:53:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009624022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:53:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906100862] [2024-11-28 03:53:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:06,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:53:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:06,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:53:06,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:53:06,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-28 03:53:06,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 76 transitions, 491 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-28 03:53:06,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:06,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-28 03:53:06,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:07,052 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 17#L63true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), 25#L88true, Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,055 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2024-11-28 03:53:07,055 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-11-28 03:53:07,055 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-11-28 03:53:07,055 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2024-11-28 03:53:07,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 17#L63true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), 25#L88true, Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,109 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-11-28 03:53:07,109 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:07,109 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:07,110 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:07,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [14#thread3EXITtrue, 63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), 17#L63true, Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,159 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-28 03:53:07,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:07,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:07,160 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:07,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [14#thread3EXITtrue, 63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 17#L63true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,206 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,207 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,208 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [37#L85true, 63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 17#L63true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 35#L112-4true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,208 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,208 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,209 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,209 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-28 03:53:07,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([315] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= (mod v_thread1Thread1of1ForFork1_~cond~0_5 256) 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} OutVars{thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][99], [37#L85true, 63#true, 47#true, 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 17#L63true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:07,236 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is not cut-off event [2024-11-28 03:53:07,236 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-28 03:53:07,236 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-28 03:53:07,237 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is not cut-off event [2024-11-28 03:53:07,294 INFO L124 PetriNetUnfolderBase]: 1759/2867 cut-off events. [2024-11-28 03:53:07,294 INFO L125 PetriNetUnfolderBase]: For 7679/7862 co-relation queries the response was YES. [2024-11-28 03:53:07,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10367 conditions, 2867 events. 1759/2867 cut-off events. For 7679/7862 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16884 event pairs, 163 based on Foata normal form. 213/2995 useless extension candidates. Maximal degree in co-relation 6049. Up to 1189 conditions per place. [2024-11-28 03:53:07,334 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 102 selfloop transitions, 16 changer transitions 0/139 dead transitions. [2024-11-28 03:53:07,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 139 transitions, 1130 flow [2024-11-28 03:53:07,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:53:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:53:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-28 03:53:07,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-11-28 03:53:07,337 INFO L175 Difference]: Start difference. First operand has 59 places, 76 transitions, 491 flow. Second operand 5 states and 125 transitions. [2024-11-28 03:53:07,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 139 transitions, 1130 flow [2024-11-28 03:53:07,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 139 transitions, 1080 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-11-28 03:53:07,397 INFO L231 Difference]: Finished difference. Result has 64 places, 89 transitions, 618 flow [2024-11-28 03:53:07,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=618, PETRI_PLACES=64, PETRI_TRANSITIONS=89} [2024-11-28 03:53:07,400 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-11-28 03:53:07,401 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 89 transitions, 618 flow [2024-11-28 03:53:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-28 03:53:07,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:07,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:07,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:53:07,402 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:07,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:07,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1138521835, now seen corresponding path program 1 times [2024-11-28 03:53:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:07,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343123591] [2024-11-28 03:53:07,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:53:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:53:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343123591] [2024-11-28 03:53:07,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343123591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:07,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:07,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:53:07,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017140247] [2024-11-28 03:53:07,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:07,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:53:07,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:53:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:53:07,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-28 03:53:07,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 89 transitions, 618 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-11-28 03:53:07,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:07,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-28 03:53:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:08,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][89], [Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 18#L50true, 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 88#true, 47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 5#L91true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 35#L112-4true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 55#true]) [2024-11-28 03:53:08,950 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-28 03:53:08,951 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 03:53:08,951 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:08,951 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:09,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][89], [Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 18#L50true, 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 88#true, 47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), 5#L91true, Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 55#true]) [2024-11-28 03:53:09,058 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,059 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:53:09,059 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,059 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][89], [Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 18#L50true, 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 14#thread3EXITtrue, 88#true, 47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 35#L112-4true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 55#true, Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1))]) [2024-11-28 03:53:09,062 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,062 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:53:09,062 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:09,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][89], [Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 18#L50true, 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 88#true, 14#thread3EXITtrue, 47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 55#true]) [2024-11-28 03:53:09,251 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 03:53:09,251 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:09,252 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:09,252 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-28 03:53:09,488 INFO L124 PetriNetUnfolderBase]: 3673/5398 cut-off events. [2024-11-28 03:53:09,489 INFO L125 PetriNetUnfolderBase]: For 17498/17777 co-relation queries the response was YES. [2024-11-28 03:53:09,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21034 conditions, 5398 events. 3673/5398 cut-off events. For 17498/17777 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 29566 event pairs, 126 based on Foata normal form. 280/5309 useless extension candidates. Maximal degree in co-relation 13822. Up to 1297 conditions per place. [2024-11-28 03:53:09,560 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 167 selfloop transitions, 57 changer transitions 0/242 dead transitions. [2024-11-28 03:53:09,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 242 transitions, 2149 flow [2024-11-28 03:53:09,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 03:53:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 03:53:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-11-28 03:53:09,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2024-11-28 03:53:09,563 INFO L175 Difference]: Start difference. First operand has 64 places, 89 transitions, 618 flow. Second operand 9 states and 189 transitions. [2024-11-28 03:53:09,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 242 transitions, 2149 flow [2024-11-28 03:53:09,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 242 transitions, 2143 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:53:09,651 INFO L231 Difference]: Finished difference. Result has 78 places, 126 transitions, 1137 flow [2024-11-28 03:53:09,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1137, PETRI_PLACES=78, PETRI_TRANSITIONS=126} [2024-11-28 03:53:09,654 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-11-28 03:53:09,655 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 126 transitions, 1137 flow [2024-11-28 03:53:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-11-28 03:53:09,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:09,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:09,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:53:09,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:09,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1916983649, now seen corresponding path program 2 times [2024-11-28 03:53:09,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767645279] [2024-11-28 03:53:09,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:53:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:09,768 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:53:09,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:53:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767645279] [2024-11-28 03:53:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767645279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:53:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:53:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 03:53:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925841956] [2024-11-28 03:53:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:53:14,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:53:14,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:14,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:53:14,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:53:14,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-28 03:53:14,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 126 transitions, 1137 flow. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 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-11-28 03:53:14,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:14,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-28 03:53:14,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:16,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][156], [47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 122#true, 14#thread3EXITtrue, 36#L53true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), 35#L112-4true, Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:16,705 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-11-28 03:53:16,705 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:16,705 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:16,706 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-28 03:53:16,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][156], [47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 122#true, 14#thread3EXITtrue, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), 35#L112-4true, Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:16,711 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,712 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][240], [107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 38#L72true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), 35#L112-4true, Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:16,867 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-28 03:53:16,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,867 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-28 03:53:16,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][156], [47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 14#thread3EXITtrue, 122#true, 36#L53true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:16,892 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-28 03:53:16,892 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:16,892 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:16,892 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-28 03:53:16,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][156], [47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 122#true, 14#thread3EXITtrue, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:16,909 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-28 03:53:16,910 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:16,910 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:16,910 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][68], [18#L50true, 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 122#true, 38#L72true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), 35#L112-4true, Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,004 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 03:53:17,004 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-28 03:53:17,004 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,004 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][240], [107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 38#L72true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,022 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 03:53:17,022 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,023 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,023 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][256], [107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 17#L63true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), 35#L112-4true, Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,037 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-28 03:53:17,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,037 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-28 03:53:17,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([321] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][156], [47#true, 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 21#L113-1true, Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 122#true, 14#thread3EXITtrue, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 11#thread2EXITtrue, Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,063 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,063 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,063 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,063 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][68], [18#L50true, 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 122#true, 38#L72true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,118 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 03:53:17,118 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,118 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-28 03:53:17,118 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][256], [63#true, 107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 15#thread1EXITtrue, Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 17#L63true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 12#L113true, Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,137 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 03:53:17,138 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,138 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,138 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][240], [107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 21#L113-1true, Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 38#L72true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,142 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([328] L82-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][256], [107#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 63#true, 47#true, Black: 65#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 75#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 73#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 77#(and (or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 79#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= thread2Thread1of1ForFork2_~cond~1 1) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 70#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 66#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296))), Black: 68#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 21#L113-1true, Black: 90#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 91#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 93#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread2Thread1of1ForFork2_~cond~1) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 37#L85true, 17#L63true, Black: 112#(and (or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 99#(or (and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))) (and (<= (mod ~u~0 4294967296) 0) (= thread3Thread1of1ForFork0_~cond~2 0))), Black: 104#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 141#(and (or (< (div ~T~0 4294967296) (div ~t~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (+ (div ~S~0 4294967296) (div ~u~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (and (<= (+ ~s~0 (mod ~S~0 4294967296)) (+ 4294967295 ~S~0)) (<= (+ ~S~0 1) (+ ~s~0 (mod ~S~0 4294967296)))) (< (+ ~T~0 1) (+ ~t~0 (mod ~T~0 4294967296)))) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~U~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296) 1))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 102#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 100#(< 0 (mod ~u~0 4294967296)), Black: 109#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~u~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 57#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 60#(and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), 55#true]) [2024-11-28 03:53:17,142 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 03:53:17,142 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 03:53:17,341 INFO L124 PetriNetUnfolderBase]: 4738/7545 cut-off events. [2024-11-28 03:53:17,341 INFO L125 PetriNetUnfolderBase]: For 37059/37668 co-relation queries the response was YES. [2024-11-28 03:53:17,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34405 conditions, 7545 events. 4738/7545 cut-off events. For 37059/37668 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 49501 event pairs, 264 based on Foata normal form. 336/7643 useless extension candidates. Maximal degree in co-relation 19834. Up to 3931 conditions per place. [2024-11-28 03:53:17,445 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 175 selfloop transitions, 86 changer transitions 24/310 dead transitions. [2024-11-28 03:53:17,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 310 transitions, 3214 flow [2024-11-28 03:53:17,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:53:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:53:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 281 transitions. [2024-11-28 03:53:17,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6328828828828829 [2024-11-28 03:53:17,448 INFO L175 Difference]: Start difference. First operand has 78 places, 126 transitions, 1137 flow. Second operand 12 states and 281 transitions. [2024-11-28 03:53:17,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 310 transitions, 3214 flow [2024-11-28 03:53:17,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 310 transitions, 3214 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:53:17,610 INFO L231 Difference]: Finished difference. Result has 98 places, 203 transitions, 2310 flow [2024-11-28 03:53:17,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2310, PETRI_PLACES=98, PETRI_TRANSITIONS=203} [2024-11-28 03:53:17,612 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 58 predicate places. [2024-11-28 03:53:17,612 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2310 flow [2024-11-28 03:53:17,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 10 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-11-28 03:53:17,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:53:17,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:53:17,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:53:17,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:53:17,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:53:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -727340741, now seen corresponding path program 3 times [2024-11-28 03:53:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:53:17,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534035360] [2024-11-28 03:53:17,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:53:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:53:17,680 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:53:17,680 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:53:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:19,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:53:19,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534035360] [2024-11-28 03:53:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534035360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:53:19,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751138018] [2024-11-28 03:53:19,998 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:53:19,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:53:19,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:53:20,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:53:20,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:53:20,151 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-28 03:53:20,151 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:53:20,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-28 03:53:20,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:53:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:22,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:53:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:53:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751138018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:53:26,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:53:26,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2024-11-28 03:53:26,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854594598] [2024-11-28 03:53:26,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:53:26,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-28 03:53:26,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:53:26,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-28 03:53:26,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=648, Unknown=0, NotChecked=0, Total=812 [2024-11-28 03:53:27,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-11-28 03:53:27,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 203 transitions, 2310 flow. Second operand has 29 states, 29 states have (on average 13.03448275862069) internal successors, (378), 29 states have internal predecessors, (378), 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-11-28 03:53:27,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:53:27,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-11-28 03:53:27,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:53:42,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:54:00,303 INFO L124 PetriNetUnfolderBase]: 38002/57381 cut-off events. [2024-11-28 03:54:00,303 INFO L125 PetriNetUnfolderBase]: For 315327/318701 co-relation queries the response was YES. [2024-11-28 03:54:00,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273757 conditions, 57381 events. 38002/57381 cut-off events. For 315327/318701 co-relation queries the response was YES. Maximal size of possible extension queue 3128. Compared 446584 event pairs, 1503 based on Foata normal form. 1137/58150 useless extension candidates. Maximal degree in co-relation 273665. Up to 10583 conditions per place. [2024-11-28 03:54:01,301 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 805 selfloop transitions, 1202 changer transitions 391/2409 dead transitions. [2024-11-28 03:54:01,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 2409 transitions, 28216 flow [2024-11-28 03:54:01,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-11-28 03:54:01,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2024-11-28 03:54:01,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 2303 transitions. [2024-11-28 03:54:01,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459933617828354 [2024-11-28 03:54:01,324 INFO L175 Difference]: Start difference. First operand has 98 places, 203 transitions, 2310 flow. Second operand 114 states and 2303 transitions. [2024-11-28 03:54:01,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 2409 transitions, 28216 flow [2024-11-28 03:54:04,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 2409 transitions, 28138 flow, removed 39 selfloop flow, removed 1 redundant places. [2024-11-28 03:54:04,590 INFO L231 Difference]: Finished difference. Result has 282 places, 1490 transitions, 22085 flow [2024-11-28 03:54:04,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=114, PETRI_FLOW=22085, PETRI_PLACES=282, PETRI_TRANSITIONS=1490} [2024-11-28 03:54:04,592 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 242 predicate places. [2024-11-28 03:54:04,592 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 1490 transitions, 22085 flow [2024-11-28 03:54:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 13.03448275862069) internal successors, (378), 29 states have internal predecessors, (378), 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-11-28 03:54:04,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:54:04,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:54:04,602 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:54:04,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:54:04,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:54:04,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:54:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1975572317, now seen corresponding path program 4 times [2024-11-28 03:54:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:54:04,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933753314] [2024-11-28 03:54:04,795 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:54:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:54:04,854 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:54:04,854 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:54:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:54:07,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:54:07,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933753314] [2024-11-28 03:54:07,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933753314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:54:07,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:54:07,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-28 03:54:07,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519839695] [2024-11-28 03:54:07,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:54:07,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:54:07,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:54:07,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:54:07,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:54:08,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-28 03:54:08,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 1490 transitions, 22085 flow. Second operand has 13 states, 13 states have (on average 13.76923076923077) internal successors, (179), 13 states have internal predecessors, (179), 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-11-28 03:54:08,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:54:08,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-28 03:54:08,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:54:48,749 INFO L124 PetriNetUnfolderBase]: 46713/69107 cut-off events. [2024-11-28 03:54:48,750 INFO L125 PetriNetUnfolderBase]: For 1672778/1694640 co-relation queries the response was YES. [2024-11-28 03:54:50,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524211 conditions, 69107 events. 46713/69107 cut-off events. For 1672778/1694640 co-relation queries the response was YES. Maximal size of possible extension queue 3407. Compared 529109 event pairs, 6142 based on Foata normal form. 1448/65984 useless extension candidates. Maximal degree in co-relation 523882. Up to 44724 conditions per place. [2024-11-28 03:54:51,894 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 1650 selfloop transitions, 188 changer transitions 103/2047 dead transitions. [2024-11-28 03:54:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 2047 transitions, 33431 flow [2024-11-28 03:54:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-28 03:54:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-28 03:54:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 308 transitions. [2024-11-28 03:54:51,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.554954954954955 [2024-11-28 03:54:51,917 INFO L175 Difference]: Start difference. First operand has 282 places, 1490 transitions, 22085 flow. Second operand 15 states and 308 transitions. [2024-11-28 03:54:51,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 2047 transitions, 33431 flow [2024-11-28 03:55:30,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 2047 transitions, 29440 flow, removed 1954 selfloop flow, removed 27 redundant places. [2024-11-28 03:55:30,863 INFO L231 Difference]: Finished difference. Result has 248 places, 1584 transitions, 21201 flow [2024-11-28 03:55:30,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19259, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=21201, PETRI_PLACES=248, PETRI_TRANSITIONS=1584} [2024-11-28 03:55:30,865 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 208 predicate places. [2024-11-28 03:55:30,865 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 1584 transitions, 21201 flow [2024-11-28 03:55:30,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.76923076923077) internal successors, (179), 13 states have internal predecessors, (179), 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-11-28 03:55:30,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:55:30,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:55:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:55:30,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 03:55:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:55:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1915393109, now seen corresponding path program 1 times [2024-11-28 03:55:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:55:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139406964] [2024-11-28 03:55:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:55:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:31,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:31,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:55:31,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139406964] [2024-11-28 03:55:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139406964] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:55:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721288292] [2024-11-28 03:55:31,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:55:31,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:55:31,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:55:31,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:55:31,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a62b888-37e2-4719-a3a8-50171797d09d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:55:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:55:31,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-28 03:55:31,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:55:32,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:32,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:55:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:55:32,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721288292] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:55:32,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:55:32,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 20 [2024-11-28 03:55:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501219664] [2024-11-28 03:55:32,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:55:32,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-28 03:55:32,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:55:32,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-28 03:55:32,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-28 03:55:33,073 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-11-28 03:55:33,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 1584 transitions, 21201 flow. Second operand has 21 states, 21 states have (on average 10.952380952380953) internal successors, (230), 21 states have internal predecessors, (230), 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-11-28 03:55:33,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:55:33,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-11-28 03:55:33,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand