./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:50:47,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:50:47,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:50:47,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:50:47,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:50:47,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:50:47,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:50:47,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:50:47,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:50:47,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:50:47,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:50:47,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:50:47,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:50:47,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:50:47,736 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:50:47,739 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:50:47,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:50:47,739 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:50:47,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:50:47,740 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:50:47,740 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:50:47,740 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:50:47,740 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:50:47,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:50:47,741 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:50:47,741 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:50:47,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:50:47,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:50:47,742 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:50:47,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:50:47,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:50:47,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:50:47,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:50:47,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:50:47,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:50:47,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:50:47,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:50:47,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:50:47,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:50:47,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:50:47,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:50:47,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:50:47,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2024-11-22 21:50:47,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:50:47,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:50:47,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:50:47,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:50:47,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:50:47,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-22 21:50:49,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:50:49,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:50:49,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2024-11-22 21:50:49,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900412c66/18104657eac64bb4a5b55f669ef60bd9/FLAG2d775e94d [2024-11-22 21:50:49,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/900412c66/18104657eac64bb4a5b55f669ef60bd9 [2024-11-22 21:50:49,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:50:49,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:50:49,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:50:49,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:50:49,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:50:49,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1188add4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49, skipping insertion in model container [2024-11-22 21:50:49,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:50:49,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:50:49,770 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:50:49,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:50:49,816 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:50:49,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49 WrapperNode [2024-11-22 21:50:49,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:50:49,819 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:50:49,819 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:50:49,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:50:49,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,859 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2024-11-22 21:50:49,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:50:49,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:50:49,860 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:50:49,860 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:50:49,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,885 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-22 21:50:49,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:50:49,904 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:50:49,904 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:50:49,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:50:49,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (1/1) ... [2024-11-22 21:50:49,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:50:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:49,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 21:50:49,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 21:50:50,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 21:50:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 21:50:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 21:50:50,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:50:50,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:50:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:50:50,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:50:50,019 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:50:50,105 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:50:50,106 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:50:50,245 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:50:50,245 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:50:50,374 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:50:50,374 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-22 21:50:50,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:50:50 BoogieIcfgContainer [2024-11-22 21:50:50,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:50:50,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:50:50,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:50:50,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:50:50,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:50:49" (1/3) ... [2024-11-22 21:50:50,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209552a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:50:50, skipping insertion in model container [2024-11-22 21:50:50,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:50:49" (2/3) ... [2024-11-22 21:50:50,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209552a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:50:50, skipping insertion in model container [2024-11-22 21:50:50,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:50:50" (3/3) ... [2024-11-22 21:50:50,385 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2024-11-22 21:50:50,399 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:50:50,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 21:50:50,400 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:50:50,453 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-22 21:50:50,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2024-11-22 21:50:50,511 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2024-11-22 21:50:50,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:50:50,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2024-11-22 21:50:50,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2024-11-22 21:50:50,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2024-11-22 21:50:50,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:50:50,543 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;@6490010d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:50:50,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 21:50:50,560 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:50:50,561 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-11-22 21:50:50,562 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 21:50:50,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:50,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:50,563 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-22 21:50:50,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 333024233, now seen corresponding path program 1 times [2024-11-22 21:50:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742885998] [2024-11-22 21:50:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:51,116 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-22 21:50:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742885998] [2024-11-22 21:50:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742885998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:50:51,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121748470] [2024-11-22 21:50:51,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:51,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:50:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:51,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:50:51,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:50:51,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2024-11-22 21:50:51,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:51,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:51,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2024-11-22 21:50:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:51,331 INFO L124 PetriNetUnfolderBase]: 321/552 cut-off events. [2024-11-22 21:50:51,332 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-22 21:50:51,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 552 events. 321/552 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2467 event pairs, 34 based on Foata normal form. 2/533 useless extension candidates. Maximal degree in co-relation 896. Up to 376 conditions per place. [2024-11-22 21:50:51,345 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 26 selfloop transitions, 4 changer transitions 1/42 dead transitions. [2024-11-22 21:50:51,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 179 flow [2024-11-22 21:50:51,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:50:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:50:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-22 21:50:51,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2024-11-22 21:50:51,359 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 3 states and 78 transitions. [2024-11-22 21:50:51,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 179 flow [2024-11-22 21:50:51,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 157 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 21:50:51,366 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2024-11-22 21:50:51,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-11-22 21:50:51,372 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2024-11-22 21:50:51,372 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2024-11-22 21:50:51,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:51,373 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:51,373 INFO L204 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] [2024-11-22 21:50:51,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:50:51,373 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-22 21:50:51,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:51,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1044271381, now seen corresponding path program 1 times [2024-11-22 21:50:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291455300] [2024-11-22 21:50:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:51,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:51,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:51,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:51,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291455300] [2024-11-22 21:50:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291455300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794301118] [2024-11-22 21:50:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:51,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-22 21:50:51,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-22 21:50:51,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:51,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-22 21:50:51,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:51,969 INFO L124 PetriNetUnfolderBase]: 577/914 cut-off events. [2024-11-22 21:50:51,970 INFO L125 PetriNetUnfolderBase]: For 198/221 co-relation queries the response was YES. [2024-11-22 21:50:51,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2076 conditions, 914 events. 577/914 cut-off events. For 198/221 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4312 event pairs, 20 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 619. Up to 436 conditions per place. [2024-11-22 21:50:51,977 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 62 selfloop transitions, 14 changer transitions 0/84 dead transitions. [2024-11-22 21:50:51,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 84 transitions, 389 flow [2024-11-22 21:50:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-11-22 21:50:51,981 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6596638655462185 [2024-11-22 21:50:51,981 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 7 states and 157 transitions. [2024-11-22 21:50:51,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 84 transitions, 389 flow [2024-11-22 21:50:51,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 84 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:50:51,985 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 184 flow [2024-11-22 21:50:51,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=184, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2024-11-22 21:50:51,986 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-11-22 21:50:51,987 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 184 flow [2024-11-22 21:50:51,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-22 21:50:51,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:51,987 INFO L204 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] [2024-11-22 21:50:51,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:50:51,988 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-22 21:50:51,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1640698263, now seen corresponding path program 2 times [2024-11-22 21:50:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601971480] [2024-11-22 21:50:51,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:52,007 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:52,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:52,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:52,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601971480] [2024-11-22 21:50:52,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601971480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:52,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:52,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182478957] [2024-11-22 21:50:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:52,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:52,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:52,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-22 21:50:52,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-22 21:50:52,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:52,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-22 21:50:52,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:52,431 INFO L124 PetriNetUnfolderBase]: 698/1107 cut-off events. [2024-11-22 21:50:52,431 INFO L125 PetriNetUnfolderBase]: For 742/780 co-relation queries the response was YES. [2024-11-22 21:50:52,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 1107 events. 698/1107 cut-off events. For 742/780 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5440 event pairs, 70 based on Foata normal form. 31/1097 useless extension candidates. Maximal degree in co-relation 2789. Up to 713 conditions per place. [2024-11-22 21:50:52,441 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 55 selfloop transitions, 21 changer transitions 2/86 dead transitions. [2024-11-22 21:50:52,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 511 flow [2024-11-22 21:50:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-11-22 21:50:52,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.634453781512605 [2024-11-22 21:50:52,443 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 184 flow. Second operand 7 states and 151 transitions. [2024-11-22 21:50:52,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 511 flow [2024-11-22 21:50:52,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 86 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:50:52,450 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 340 flow [2024-11-22 21:50:52,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2024-11-22 21:50:52,452 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2024-11-22 21:50:52,452 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 340 flow [2024-11-22 21:50:52,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-22 21:50:52,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:52,453 INFO L204 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] [2024-11-22 21:50:52,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:50:52,454 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-22 21:50:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1193433297, now seen corresponding path program 3 times [2024-11-22 21:50:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695930348] [2024-11-22 21:50:52,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:50:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:52,477 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 21:50:52,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:52,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695930348] [2024-11-22 21:50:52,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695930348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261047182] [2024-11-22 21:50:52,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:52,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:52,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:52,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-22 21:50:52,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:52,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:52,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-22 21:50:52,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:53,106 INFO L124 PetriNetUnfolderBase]: 1454/2181 cut-off events. [2024-11-22 21:50:53,106 INFO L125 PetriNetUnfolderBase]: For 2634/2702 co-relation queries the response was YES. [2024-11-22 21:50:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6874 conditions, 2181 events. 1454/2181 cut-off events. For 2634/2702 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 11369 event pairs, 123 based on Foata normal form. 31/2181 useless extension candidates. Maximal degree in co-relation 5199. Up to 915 conditions per place. [2024-11-22 21:50:53,126 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 84 selfloop transitions, 34 changer transitions 2/127 dead transitions. [2024-11-22 21:50:53,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 872 flow [2024-11-22 21:50:53,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:50:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:50:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions. [2024-11-22 21:50:53,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-11-22 21:50:53,128 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 340 flow. Second operand 8 states and 187 transitions. [2024-11-22 21:50:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 872 flow [2024-11-22 21:50:53,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 830 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-22 21:50:53,142 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 530 flow [2024-11-22 21:50:53,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2024-11-22 21:50:53,143 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2024-11-22 21:50:53,143 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 530 flow [2024-11-22 21:50:53,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:53,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:53,144 INFO L204 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] [2024-11-22 21:50:53,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:50:53,144 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-22 21:50:53,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:53,145 INFO L85 PathProgramCache]: Analyzing trace with hash -494408837, now seen corresponding path program 4 times [2024-11-22 21:50:53,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:53,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797020857] [2024-11-22 21:50:53,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:50:53,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:53,164 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:50:53,164 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:53,344 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-22 21:50:53,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797020857] [2024-11-22 21:50:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797020857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089488473] [2024-11-22 21:50:53,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:50:53,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:53,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:53,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:53,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 21:50:53,411 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:50:53,412 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:53,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:50:53,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:53,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:50:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089488473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 21:50:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-22 21:50:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665912020] [2024-11-22 21:50:53,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:53,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:50:53,554 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2024-11-22 21:50:53,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-22 21:50:53,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:53,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2024-11-22 21:50:53,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:53,852 INFO L124 PetriNetUnfolderBase]: 1373/2144 cut-off events. [2024-11-22 21:50:53,853 INFO L125 PetriNetUnfolderBase]: For 4610/4671 co-relation queries the response was YES. [2024-11-22 21:50:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7739 conditions, 2144 events. 1373/2144 cut-off events. For 4610/4671 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 11823 event pairs, 171 based on Foata normal form. 38/2138 useless extension candidates. Maximal degree in co-relation 6080. Up to 1252 conditions per place. [2024-11-22 21:50:53,873 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 65 selfloop transitions, 35 changer transitions 2/111 dead transitions. [2024-11-22 21:50:53,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 111 transitions, 943 flow [2024-11-22 21:50:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:50:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:50:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-11-22 21:50:53,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6139705882352942 [2024-11-22 21:50:53,875 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 530 flow. Second operand 8 states and 167 transitions. [2024-11-22 21:50:53,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 111 transitions, 943 flow [2024-11-22 21:50:53,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 922 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-22 21:50:53,922 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 681 flow [2024-11-22 21:50:53,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2024-11-22 21:50:53,923 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-11-22 21:50:53,924 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 681 flow [2024-11-22 21:50:53,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 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-22 21:50:53,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:53,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:53,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 21:50:54,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:54,133 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-22 21:50:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 825649844, now seen corresponding path program 1 times [2024-11-22 21:50:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:54,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163408891] [2024-11-22 21:50:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:54,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:54,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163408891] [2024-11-22 21:50:54,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163408891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:54,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:54,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:50:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950513025] [2024-11-22 21:50:54,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:54,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:54,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:54,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-22 21:50:54,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:54,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:54,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-22 21:50:54,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:54,756 INFO L124 PetriNetUnfolderBase]: 1771/2725 cut-off events. [2024-11-22 21:50:54,756 INFO L125 PetriNetUnfolderBase]: For 9083/9227 co-relation queries the response was YES. [2024-11-22 21:50:54,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11137 conditions, 2725 events. 1771/2725 cut-off events. For 9083/9227 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 15319 event pairs, 198 based on Foata normal form. 49/2737 useless extension candidates. Maximal degree in co-relation 8628. Up to 1448 conditions per place. [2024-11-22 21:50:54,778 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 93 selfloop transitions, 29 changer transitions 2/131 dead transitions. [2024-11-22 21:50:54,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 131 transitions, 1232 flow [2024-11-22 21:50:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-11-22 21:50:54,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-11-22 21:50:54,780 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 681 flow. Second operand 7 states and 154 transitions. [2024-11-22 21:50:54,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 131 transitions, 1232 flow [2024-11-22 21:50:54,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 131 transitions, 1162 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-11-22 21:50:54,808 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 758 flow [2024-11-22 21:50:54,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=758, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2024-11-22 21:50:54,809 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2024-11-22 21:50:54,809 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 758 flow [2024-11-22 21:50:54,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 21:50:54,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:54,810 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:54,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:50:54,810 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-22 21:50:54,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 465868474, now seen corresponding path program 2 times [2024-11-22 21:50:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900916550] [2024-11-22 21:50:54,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:54,838 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:54,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:55,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:55,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:55,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900916550] [2024-11-22 21:50:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900916550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:55,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:55,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:50:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600189609] [2024-11-22 21:50:55,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:55,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:55,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:55,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:50:55,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-11-22 21:50:55,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 758 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-22 21:50:55,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:55,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-11-22 21:50:55,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:55,938 INFO L124 PetriNetUnfolderBase]: 2652/3999 cut-off events. [2024-11-22 21:50:55,938 INFO L125 PetriNetUnfolderBase]: For 16575/16841 co-relation queries the response was YES. [2024-11-22 21:50:55,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16891 conditions, 3999 events. 2652/3999 cut-off events. For 16575/16841 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 21570 event pairs, 615 based on Foata normal form. 28/3720 useless extension candidates. Maximal degree in co-relation 13474. Up to 3497 conditions per place. [2024-11-22 21:50:55,972 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 81 selfloop transitions, 38 changer transitions 12/141 dead transitions. [2024-11-22 21:50:55,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 141 transitions, 1410 flow [2024-11-22 21:50:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 21:50:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-22 21:50:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-11-22 21:50:55,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5845588235294118 [2024-11-22 21:50:55,974 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 758 flow. Second operand 8 states and 159 transitions. [2024-11-22 21:50:55,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 141 transitions, 1410 flow [2024-11-22 21:50:56,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 141 transitions, 1362 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-22 21:50:56,024 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 1051 flow [2024-11-22 21:50:56,025 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1051, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2024-11-22 21:50:56,025 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2024-11-22 21:50:56,025 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 1051 flow [2024-11-22 21:50:56,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-22 21:50:56,026 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:56,026 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:56,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:50:56,026 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-22 21:50:56,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1374138146, now seen corresponding path program 1 times [2024-11-22 21:50:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605649529] [2024-11-22 21:50:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:50:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:50:56,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:56,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605649529] [2024-11-22 21:50:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605649529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:50:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111070821] [2024-11-22 21:50:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:56,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 21:50:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 21:50:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 21:50:56,246 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-11-22 21:50:56,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 1051 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-22 21:50:56,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:56,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-11-22 21:50:56,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:57,318 INFO L124 PetriNetUnfolderBase]: 5189/7892 cut-off events. [2024-11-22 21:50:57,318 INFO L125 PetriNetUnfolderBase]: For 35609/36224 co-relation queries the response was YES. [2024-11-22 21:50:57,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33667 conditions, 7892 events. 5189/7892 cut-off events. For 35609/36224 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 47745 event pairs, 1184 based on Foata normal form. 157/7989 useless extension candidates. Maximal degree in co-relation 27939. Up to 2624 conditions per place. [2024-11-22 21:50:57,390 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 118 selfloop transitions, 87 changer transitions 6/221 dead transitions. [2024-11-22 21:50:57,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 221 transitions, 2510 flow [2024-11-22 21:50:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:50:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:50:57,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-11-22 21:50:57,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.680672268907563 [2024-11-22 21:50:57,392 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 1051 flow. Second operand 7 states and 162 transitions. [2024-11-22 21:50:57,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 221 transitions, 2510 flow [2024-11-22 21:50:57,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 221 transitions, 2468 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-11-22 21:50:57,528 INFO L231 Difference]: Finished difference. Result has 95 places, 141 transitions, 1869 flow [2024-11-22 21:50:57,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1869, PETRI_PLACES=95, PETRI_TRANSITIONS=141} [2024-11-22 21:50:57,529 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2024-11-22 21:50:57,529 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 141 transitions, 1869 flow [2024-11-22 21:50:57,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-22 21:50:57,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:57,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 21:50:57,530 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-22 21:50:57,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash -358962586, now seen corresponding path program 3 times [2024-11-22 21:50:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181061536] [2024-11-22 21:50:57,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:50:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:57,544 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 21:50:57,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:50:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181061536] [2024-11-22 21:50:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181061536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:50:57,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:50:57,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 21:50:57,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830910756] [2024-11-22 21:50:57,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:50:57,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 21:50:57,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:50:57,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 21:50:57,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:50:57,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-11-22 21:50:57,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 141 transitions, 1869 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-22 21:50:57,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:50:57,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-11-22 21:50:57,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:50:58,866 INFO L124 PetriNetUnfolderBase]: 5014/7553 cut-off events. [2024-11-22 21:50:58,866 INFO L125 PetriNetUnfolderBase]: For 52828/53432 co-relation queries the response was YES. [2024-11-22 21:50:58,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38921 conditions, 7553 events. 5014/7553 cut-off events. For 52828/53432 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 44516 event pairs, 1242 based on Foata normal form. 106/7598 useless extension candidates. Maximal degree in co-relation 31723. Up to 6688 conditions per place. [2024-11-22 21:50:58,927 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 136 selfloop transitions, 66 changer transitions 12/224 dead transitions. [2024-11-22 21:50:58,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 224 transitions, 3023 flow [2024-11-22 21:50:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:50:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:50:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2024-11-22 21:50:58,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.538235294117647 [2024-11-22 21:50:58,929 INFO L175 Difference]: Start difference. First operand has 95 places, 141 transitions, 1869 flow. Second operand 10 states and 183 transitions. [2024-11-22 21:50:58,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 224 transitions, 3023 flow [2024-11-22 21:50:59,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 224 transitions, 3023 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:50:59,109 INFO L231 Difference]: Finished difference. Result has 110 places, 162 transitions, 2408 flow [2024-11-22 21:50:59,109 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2408, PETRI_PLACES=110, PETRI_TRANSITIONS=162} [2024-11-22 21:50:59,110 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 73 predicate places. [2024-11-22 21:50:59,110 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 162 transitions, 2408 flow [2024-11-22 21:50:59,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 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-22 21:50:59,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:50:59,110 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:50:59,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:50:59,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:50:59,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:50:59,111 INFO L85 PathProgramCache]: Analyzing trace with hash -393446852, now seen corresponding path program 2 times [2024-11-22 21:50:59,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:50:59,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381308728] [2024-11-22 21:50:59,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:59,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:50:59,131 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:59,131 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:59,350 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-22 21:50:59,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:50:59,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381308728] [2024-11-22 21:50:59,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381308728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:50:59,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918839707] [2024-11-22 21:50:59,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:50:59,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:50:59,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:50:59,354 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:50:59,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 21:50:59,416 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:50:59,417 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:50:59,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:50:59,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:50:59,627 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-22 21:50:59,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:00,109 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-22 21:51:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918839707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:00,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-22 21:51:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432339334] [2024-11-22 21:51:00,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 21:51:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 21:51:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-22 21:51:00,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-22 21:51:00,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 162 transitions, 2408 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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-22 21:51:00,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:00,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-22 21:51:00,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:00,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L60-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork2_~cond~1_1) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_1, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][51], [33#L53true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 73#true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, 34#L72true, Black: 168#true, 28#L80true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,667 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([255] 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_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][29], [Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, 27#$Ultimate##0true, Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), 13#thread1EXITtrue, Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,667 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 14 ancestors and is cut-off event [2024-11-22 21:51:00,667 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][46], [Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, 14#L50true, Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, Black: 168#true, 27#$Ultimate##0true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 238#true]) [2024-11-22 21:51:00,720 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2024-11-22 21:51:00,720 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,720 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,721 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L60-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork2_~cond~1_1) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_1, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][74], [Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), 3#L45true, Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, 34#L72true, Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,721 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,721 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,722 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,722 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:00,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L60-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork2_~cond~1_1) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_1, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][51], [24#L100true, 33#L53true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 73#true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 34#L72true, Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,784 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-22 21:51:00,784 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,784 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,785 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([255] 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_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|, thread1Thread1of1ForFork1_~cond~0=v_thread1Thread1of1ForFork1_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][29], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 73#true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 27#$Ultimate##0true, Black: 168#true, 28#L80true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), 13#thread1EXITtrue, Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,785 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,785 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,785 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-22 21:51:00,785 INFO L297 olderBase$Statistics]: existing Event has 15 ancestors and is cut-off event [2024-11-22 21:51:00,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([256] L45-->L50: Formula: (let ((.cse0 (mod v_~N~0_64 4294967296))) (or (and (< 0 .cse0) (= v_~p~0_49 (+ v_~p~0_50 v_~M~0_48)) (= (+ 1 v_~N~0_63) v_~N~0_64)) (and (<= .cse0 0) (= |v_thread1Thread1of1ForFork1_#t~post1_2| |v_thread1Thread1of1ForFork1_#t~post1_1|) (= v_~p~0_50 v_~p~0_49) (= v_~N~0_64 v_~N~0_63)))) InVars {~p~0=v_~p~0_50, ~N~0=v_~N~0_64, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} OutVars{~p~0=v_~p~0_49, ~N~0=v_~N~0_63, ~M~0=v_~M~0_48, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~p~0, ~N~0][46], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, 14#L50true, Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 168#true, 27#$Ultimate##0true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), 238#true]) [2024-11-22 21:51:00,866 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2024-11-22 21:51:00,866 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:00,866 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,866 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-11-22 21:51:00,866 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L60-->L72: Formula: (= (ite (= (ite (< 1 (mod v_~N~0_12 4294967296)) 1 0) 0) 0 1) v_thread2Thread1of1ForFork2_~cond~1_1) InVars {~N~0=v_~N~0_12} OutVars{thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_1, ~N~0=v_~N~0_12} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~cond~1][74], [24#L100true, Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 194#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 67#(and (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~L~0 4294967296))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 188#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 80#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, Black: 227#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0)), 3#L45true, Black: 231#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 229#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 223#(and (not (= (mod ~N~0 4294967296) 1)) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 215#true, 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 34#L72true, Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), Black: 52#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 55#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 0))]) [2024-11-22 21:51:00,867 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-22 21:51:00,868 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:00,868 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-22 21:51:00,868 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-11-22 21:51:01,841 INFO L124 PetriNetUnfolderBase]: 8870/13455 cut-off events. [2024-11-22 21:51:01,842 INFO L125 PetriNetUnfolderBase]: For 108142/108555 co-relation queries the response was YES. [2024-11-22 21:51:01,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72909 conditions, 13455 events. 8870/13455 cut-off events. For 108142/108555 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 86935 event pairs, 1142 based on Foata normal form. 384/13656 useless extension candidates. Maximal degree in co-relation 63327. Up to 4698 conditions per place. [2024-11-22 21:51:02,062 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 179 selfloop transitions, 94 changer transitions 8/317 dead transitions. [2024-11-22 21:51:02,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 317 transitions, 4446 flow [2024-11-22 21:51:02,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 21:51:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 21:51:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 208 transitions. [2024-11-22 21:51:02,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6797385620915033 [2024-11-22 21:51:02,065 INFO L175 Difference]: Start difference. First operand has 110 places, 162 transitions, 2408 flow. Second operand 9 states and 208 transitions. [2024-11-22 21:51:02,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 317 transitions, 4446 flow [2024-11-22 21:51:02,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 317 transitions, 4161 flow, removed 36 selfloop flow, removed 11 redundant places. [2024-11-22 21:51:02,411 INFO L231 Difference]: Finished difference. Result has 106 places, 200 transitions, 3069 flow [2024-11-22 21:51:02,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2045, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3069, PETRI_PLACES=106, PETRI_TRANSITIONS=200} [2024-11-22 21:51:02,412 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2024-11-22 21:51:02,412 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 200 transitions, 3069 flow [2024-11-22 21:51:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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-22 21:51:02,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:02,413 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:02,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 21:51:02,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 21:51:02,614 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:51:02,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:02,615 INFO L85 PathProgramCache]: Analyzing trace with hash 492640806, now seen corresponding path program 1 times [2024-11-22 21:51:02,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:02,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774471920] [2024-11-22 21:51:02,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:02,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:02,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774471920] [2024-11-22 21:51:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774471920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834894504] [2024-11-22 21:51:02,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:02,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:02,884 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:02,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 21:51:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:02,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 21:51:02,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:03,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:03,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:03,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834894504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:03,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-11-22 21:51:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099382759] [2024-11-22 21:51:03,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:03,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 21:51:03,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 21:51:03,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-22 21:51:03,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-22 21:51:03,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 200 transitions, 3069 flow. Second operand has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 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-22 21:51:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-22 21:51:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:06,678 INFO L124 PetriNetUnfolderBase]: 13385/21124 cut-off events. [2024-11-22 21:51:06,678 INFO L125 PetriNetUnfolderBase]: For 183394/183829 co-relation queries the response was YES. [2024-11-22 21:51:06,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119578 conditions, 21124 events. 13385/21124 cut-off events. For 183394/183829 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 156973 event pairs, 1098 based on Foata normal form. 158/20871 useless extension candidates. Maximal degree in co-relation 100714. Up to 9345 conditions per place. [2024-11-22 21:51:07,027 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 263 selfloop transitions, 246 changer transitions 4/530 dead transitions. [2024-11-22 21:51:07,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 530 transitions, 7789 flow [2024-11-22 21:51:07,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 21:51:07,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-22 21:51:07,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 336 transitions. [2024-11-22 21:51:07,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2024-11-22 21:51:07,030 INFO L175 Difference]: Start difference. First operand has 106 places, 200 transitions, 3069 flow. Second operand 15 states and 336 transitions. [2024-11-22 21:51:07,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 530 transitions, 7789 flow [2024-11-22 21:51:07,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 530 transitions, 7550 flow, removed 68 selfloop flow, removed 6 redundant places. [2024-11-22 21:51:07,630 INFO L231 Difference]: Finished difference. Result has 118 places, 364 transitions, 6260 flow [2024-11-22 21:51:07,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6260, PETRI_PLACES=118, PETRI_TRANSITIONS=364} [2024-11-22 21:51:07,631 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 81 predicate places. [2024-11-22 21:51:07,631 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 364 transitions, 6260 flow [2024-11-22 21:51:07,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.0) internal successors, (225), 15 states have internal predecessors, (225), 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-22 21:51:07,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:07,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:07,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 21:51:07,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:07,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:51:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1195772194, now seen corresponding path program 2 times [2024-11-22 21:51:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332754513] [2024-11-22 21:51:07,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:07,850 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:07,851 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:08,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332754513] [2024-11-22 21:51:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332754513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631133507] [2024-11-22 21:51:08,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:08,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:08,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 21:51:08,185 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:08,185 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:08,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:51:08,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:08,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:08,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631133507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:08,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:08,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-22 21:51:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756410303] [2024-11-22 21:51:08,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:08,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:51:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:51:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:51:08,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2024-11-22 21:51:08,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 364 transitions, 6260 flow. Second operand has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 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-22 21:51:08,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:08,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2024-11-22 21:51:08,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:10,206 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][286], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), 395#true, Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 62#(= ~N~0 ~L~0), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 7#L83true, 168#true, 19#L69true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 14#L50true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, Black: 173#(<= 1 (mod ~L~0 4294967296)), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 238#true, 580#true, Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))))]) [2024-11-22 21:51:10,207 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-11-22 21:51:10,207 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,207 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:10,207 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:10,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][286], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 395#true, Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), 24#L100true, Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 7#L83true, 168#true, 48#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 14#L50true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 173#(<= 1 (mod ~L~0 4294967296)), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 238#true, Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:10,625 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,625 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,625 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:10,625 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][196], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 395#true, Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 14#L50true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 17#L99-4true, Black: 170#(= ~N~0 ~L~0), Black: 168#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 28#L80true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:10,666 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,666 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:10,666 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,666 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][369], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 168#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 14#L50true, 53#(<= (mod ~L~0 4294967296) 0), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 10#thread3EXITtrue, Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 17#L99-4true, Black: 170#(= ~N~0 ~L~0), Black: 173#(<= 1 (mod ~L~0 4294967296)), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 238#true, Black: 395#true, 580#true, Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))))]) [2024-11-22 21:51:10,667 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,667 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:10,667 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,667 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][281], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 395#true, Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, 3#L45true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), 17#L99-4true, Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:10,980 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,980 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:10,980 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:10,980 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:11,092 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][196], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 395#true, Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 14#L50true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 17#L99-4true, Black: 170#(= ~N~0 ~L~0), Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:11,093 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,093 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,093 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,093 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-22 21:51:11,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][196], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), 395#true, Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), 24#L100true, Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 73#true, Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 48#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 14#L50true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 168#true, 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:11,128 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,128 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:11,128 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,128 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,129 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][369], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), 24#L100true, Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 73#true, 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 168#true, 19#L69true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), 14#L50true, Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 53#(<= (mod ~L~0 4294967296) 0), Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 10#thread3EXITtrue, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 173#(<= 1 (mod ~L~0 4294967296)), 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 238#true, Black: 395#true, Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:11,129 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,129 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,129 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-22 21:51:11,129 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][281], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), 395#true, Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), 24#L100true, Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 62#(= ~N~0 ~L~0), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 19#L69true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 73#true, 3#L45true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 168#true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 28#L80true, Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296)))), 580#true]) [2024-11-22 21:51:11,245 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,245 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,246 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-22 21:51:11,246 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-22 21:51:11,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([262] L64-->L69: Formula: (let ((.cse0 (mod v_~N~0_72 4294967296))) (or (and (= (+ 2 v_~N~0_71) v_~N~0_72) (= v_~p~0_57 (+ v_~p~0_58 (* 2 v_~M~0_52))) (< 1 .cse0)) (and (= v_~N~0_72 v_~N~0_71) (<= .cse0 1) (= v_~p~0_58 v_~p~0_57)))) InVars {~p~0=v_~p~0_58, ~N~0=v_~N~0_72, ~M~0=v_~M~0_52} OutVars{~p~0=v_~p~0_57, ~N~0=v_~N~0_71, ~M~0=v_~M~0_52} AuxVars[] AssignedVars[~p~0, ~N~0][196], [Black: 565#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296)))), 395#true, Black: 495#(or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))), Black: 491#(or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))), 24#L100true, Black: 561#(and (or (and (<= 1 (mod ~N~0 4294967296)) (= (mod (+ (* 4294967295 ~p~0) ~q~0) 4294967296) 0)) (< 0 (mod (+ 4294967295 ~L~0) 4294967296))) (or (< 0 (mod ~L~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)))), Black: 65#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 389#(and (= (mod ~q~0 4294967296) (mod ~p~0 4294967296)) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< 0 (mod ~L~0 4294967296)) (< (mod ~N~0 4294967296) 2))), Black: 243#(<= 2 (mod ~L~0 4294967296)), Black: 62#(= ~N~0 ~L~0), Black: 196#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 64#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 387#(and (<= 2 (mod ~L~0 4294967296)) (= ~q~0 0) (= (mod ~p~0 2) 0)), Black: 238#true, 348#(or (and (or (< 1 (mod ~N~0 4294967296)) (= (mod ~q~0 4294967296) (mod ~p~0 4294967296))) (or (forall ((~M~0 Int)) (= (mod (+ (* 2 ~M~0) ~p~0) 4294967296) (mod ~q~0 4294967296))) (< (mod ~N~0 4294967296) 2))) (< 0 (mod ~L~0 4294967296))), Black: 208#(and (= thread1Thread1of1ForFork1_~cond~0 1) (or (and (= thread2Thread1of1ForFork2_~cond~1 0) (= (mod ~N~0 4294967296) 1)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 205#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 78#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 77#(or (< (mod ~L~0 4294967296) 1) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 204#(and (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 203#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 76#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), 180#true, 19#L69true, 48#true, Black: 164#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 138#(<= 1 (mod ~N~0 4294967296)), Black: 142#(= thread1Thread1of1ForFork1_~cond~0 1), 14#L50true, 73#true, Black: 218#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), 173#(<= 1 (mod ~L~0 4294967296)), Black: 219#(and (not (= (mod ~N~0 4294967296) 1)) (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork2_~cond~1 1)))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 171#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 170#(= ~N~0 ~L~0), Black: 168#true, 28#L80true, Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 50#(= ~N~0 ~L~0), 206#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 580#true, Black: 569#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (= (mod ~p~0 4294967296) (mod (+ ~M~0 ~q~0) 4294967296))) (= ~q~0 ~p~0) (or (= ~p~0 0) (< 0 (mod (+ ~L~0 1) 4294967296))))]) [2024-11-22 21:51:11,501 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-22 21:51:11,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-22 21:51:11,501 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-22 21:51:11,501 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-11-22 21:51:12,163 INFO L124 PetriNetUnfolderBase]: 14994/23419 cut-off events. [2024-11-22 21:51:12,163 INFO L125 PetriNetUnfolderBase]: For 268535/269872 co-relation queries the response was YES. [2024-11-22 21:51:12,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147125 conditions, 23419 events. 14994/23419 cut-off events. For 268535/269872 co-relation queries the response was YES. Maximal size of possible extension queue 1705. Compared 174212 event pairs, 2239 based on Foata normal form. 324/23070 useless extension candidates. Maximal degree in co-relation 141106. Up to 16875 conditions per place. [2024-11-22 21:51:12,322 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 288 selfloop transitions, 246 changer transitions 3/554 dead transitions. [2024-11-22 21:51:12,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 554 transitions, 9923 flow [2024-11-22 21:51:12,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 21:51:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-22 21:51:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 228 transitions. [2024-11-22 21:51:12,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6096256684491979 [2024-11-22 21:51:12,324 INFO L175 Difference]: Start difference. First operand has 118 places, 364 transitions, 6260 flow. Second operand 11 states and 228 transitions. [2024-11-22 21:51:12,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 554 transitions, 9923 flow [2024-11-22 21:51:13,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 554 transitions, 9240 flow, removed 316 selfloop flow, removed 3 redundant places. [2024-11-22 21:51:13,735 INFO L231 Difference]: Finished difference. Result has 128 places, 468 transitions, 8306 flow [2024-11-22 21:51:13,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5747, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8306, PETRI_PLACES=128, PETRI_TRANSITIONS=468} [2024-11-22 21:51:13,736 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 91 predicate places. [2024-11-22 21:51:13,736 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 468 transitions, 8306 flow [2024-11-22 21:51:13,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 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-22 21:51:13,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:13,736 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:13,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 21:51:13,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:13,937 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:51:13,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -2130296446, now seen corresponding path program 1 times [2024-11-22 21:51:13,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:13,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164089977] [2024-11-22 21:51:13,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:13,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164089977] [2024-11-22 21:51:14,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164089977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739142709] [2024-11-22 21:51:14,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:51:14,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:14,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:14,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:14,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 21:51:14,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:51:14,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 21:51:14,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:14,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:14,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:14,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739142709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:14,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:14,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 9] total 16 [2024-11-22 21:51:14,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944089549] [2024-11-22 21:51:14,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:14,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-22 21:51:14,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-22 21:51:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-11-22 21:51:14,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-11-22 21:51:14,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 468 transitions, 8306 flow. Second operand has 17 states, 17 states have (on average 10.529411764705882) internal successors, (179), 17 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-22 21:51:14,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:14,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-11-22 21:51:14,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:51:23,688 INFO L124 PetriNetUnfolderBase]: 31943/47136 cut-off events. [2024-11-22 21:51:23,688 INFO L125 PetriNetUnfolderBase]: For 590481/590484 co-relation queries the response was YES. [2024-11-22 21:51:23,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302479 conditions, 47136 events. 31943/47136 cut-off events. For 590481/590484 co-relation queries the response was YES. Maximal size of possible extension queue 2497. Compared 336870 event pairs, 816 based on Foata normal form. 1168/48301 useless extension candidates. Maximal degree in co-relation 298350. Up to 10452 conditions per place. [2024-11-22 21:51:24,181 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 608 selfloop transitions, 1486 changer transitions 0/2098 dead transitions. [2024-11-22 21:51:24,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 2098 transitions, 34314 flow [2024-11-22 21:51:24,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-22 21:51:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2024-11-22 21:51:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 1233 transitions. [2024-11-22 21:51:24,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5180672268907563 [2024-11-22 21:51:24,187 INFO L175 Difference]: Start difference. First operand has 128 places, 468 transitions, 8306 flow. Second operand 70 states and 1233 transitions. [2024-11-22 21:51:24,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 2098 transitions, 34314 flow [2024-11-22 21:51:28,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 2098 transitions, 33462 flow, removed 378 selfloop flow, removed 4 redundant places. [2024-11-22 21:51:28,413 INFO L231 Difference]: Finished difference. Result has 243 places, 1736 transitions, 33066 flow [2024-11-22 21:51:28,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=7565, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=33066, PETRI_PLACES=243, PETRI_TRANSITIONS=1736} [2024-11-22 21:51:28,414 INFO L277 CegarLoopForPetriNet]: 37 programPoint places, 206 predicate places. [2024-11-22 21:51:28,414 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 1736 transitions, 33066 flow [2024-11-22 21:51:28,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.529411764705882) internal successors, (179), 17 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-22 21:51:28,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:51:28,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:51:28,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 21:51:28,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 21:51:28,615 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-22 21:51:28,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:51:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -619159534, now seen corresponding path program 2 times [2024-11-22 21:51:28,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:51:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894652302] [2024-11-22 21:51:28,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:51:28,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:28,629 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:51:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894652302] [2024-11-22 21:51:28,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894652302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:51:28,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159042061] [2024-11-22 21:51:28,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:51:28,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:51:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:51:28,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 21:51:28,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 21:51:28,857 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:51:28,857 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:51:28,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-22 21:51:28,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:51:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:29,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:51:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 21:51:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159042061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:51:29,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:51:29,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2024-11-22 21:51:29,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993699102] [2024-11-22 21:51:29,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:51:29,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 21:51:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:51:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 21:51:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-22 21:51:29,368 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-11-22 21:51:29,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1736 transitions, 33066 flow. Second operand has 16 states, 16 states have (on average 10.875) internal successors, (174), 16 states have internal predecessors, (174), 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-22 21:51:29,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:51:29,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-11-22 21:51:29,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand