./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.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/parallel-barrier.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 21:44:43,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:44:44,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:44:44,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:44:44,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:44:44,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:44:44,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:44:44,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:44:44,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:44:44,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:44:44,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:44:44,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:44:44,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:44:44,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:44:44,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:44:44,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:44:44,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:44:44,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:44:44,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:44:44,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:44:44,072 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:44:44,072 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:44:44,072 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:44:44,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:44:44,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:44:44,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:44:44,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:44:44,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:44:44,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:44:44,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:44:44,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:44:44,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:44:44,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:44:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:44:44,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:44:44,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:44:44,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:44:44,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:44:44,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:44:44,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:44:44,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:44:44,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:44:44,078 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2024-11-22 21:44:44,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:44:44,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:44:44,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:44:44,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:44:44,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:44:44,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-22 21:44:45,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:44:45,692 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:44:45,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-22 21:44:45,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68b2a85be/1414e009fb214df589e52595bc7b04d4/FLAG45de7b550 [2024-11-22 21:44:45,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68b2a85be/1414e009fb214df589e52595bc7b04d4 [2024-11-22 21:44:45,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:44:45,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:44:45,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:44:45,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:44:45,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:44:45,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:45,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73426311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45, skipping insertion in model container [2024-11-22 21:44:45,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:45,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:44:45,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:44:45,926 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:44:45,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:44:45,962 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:44:45,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45 WrapperNode [2024-11-22 21:44:45,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:44:45,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:44:45,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:44:45,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:44:45,969 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:44:45" (1/1) ... [2024-11-22 21:44:45,975 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:44:45" (1/1) ... [2024-11-22 21:44:45,994 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 212 [2024-11-22 21:44:45,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:44:45,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:44:45,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:44:45,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:44:46,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,026 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:44:46,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:44:46,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:44:46,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:44:46,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:44:46,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (1/1) ... [2024-11-22 21:44:46,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:44:46,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:44:46,092 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:44:46,093 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:44:46,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:44:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 21:44:46,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 21:44:46,138 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 21:44:46,138 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 21:44:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 21:44:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 21:44:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 21:44:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 21:44:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:44:46,139 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-22 21:44:46,139 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-22 21:44:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-22 21:44:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-22 21:44:46,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:44:46,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:44:46,142 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:44:46,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:44:46,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:44:46,539 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:44:46,539 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:44:46,688 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:44:46,688 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-22 21:44:46,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:46 BoogieIcfgContainer [2024-11-22 21:44:46,689 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:44:46,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:44:46,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:44:46,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:44:46,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:44:45" (1/3) ... [2024-11-22 21:44:46,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c50d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:46, skipping insertion in model container [2024-11-22 21:44:46,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:44:45" (2/3) ... [2024-11-22 21:44:46,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c50d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:44:46, skipping insertion in model container [2024-11-22 21:44:46,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:44:46" (3/3) ... [2024-11-22 21:44:46,696 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2024-11-22 21:44:46,708 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:44:46,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 21:44:46,709 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:44:46,781 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-22 21:44:46,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 84 transitions, 234 flow [2024-11-22 21:44:46,852 INFO L124 PetriNetUnfolderBase]: 4/72 cut-off events. [2024-11-22 21:44:46,852 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-22 21:44:46,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 72 events. 4/72 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 120 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2024-11-22 21:44:46,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 84 transitions, 234 flow [2024-11-22 21:44:46,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 71 transitions, 190 flow [2024-11-22 21:44:46,871 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:44:46,876 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;@716d6189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:44:46,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-22 21:44:46,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:44:46,893 INFO L124 PetriNetUnfolderBase]: 4/68 cut-off events. [2024-11-22 21:44:46,893 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-22 21:44:46,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:44:46,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:44:46,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:44:46,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:44:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1563154494, now seen corresponding path program 1 times [2024-11-22 21:44:46,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:44:46,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657884983] [2024-11-22 21:44:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:44:46,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:44:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:44:47,294 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:44:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:44:47,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657884983] [2024-11-22 21:44:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657884983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:44:47,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:44:47,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:44:47,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695003745] [2024-11-22 21:44:47,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:44:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:44:47,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:44:47,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:44:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:44:47,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2024-11-22 21:44:47,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:47,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:44:47,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2024-11-22 21:44:47,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:44:48,951 INFO L124 PetriNetUnfolderBase]: 14053/19485 cut-off events. [2024-11-22 21:44:48,952 INFO L125 PetriNetUnfolderBase]: For 1965/1965 co-relation queries the response was YES. [2024-11-22 21:44:49,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41069 conditions, 19485 events. 14053/19485 cut-off events. For 1965/1965 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 109115 event pairs, 8277 based on Foata normal form. 489/18937 useless extension candidates. Maximal degree in co-relation 40672. Up to 13270 conditions per place. [2024-11-22 21:44:49,097 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 67 selfloop transitions, 4 changer transitions 0/90 dead transitions. [2024-11-22 21:44:49,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 391 flow [2024-11-22 21:44:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:44:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:44:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-11-22 21:44:49,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-11-22 21:44:49,109 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 190 flow. Second operand 3 states and 151 transitions. [2024-11-22 21:44:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 391 flow [2024-11-22 21:44:49,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 90 transitions, 345 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-22 21:44:49,212 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 168 flow [2024-11-22 21:44:49,215 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2024-11-22 21:44:49,220 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -11 predicate places. [2024-11-22 21:44:49,220 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 168 flow [2024-11-22 21:44:49,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:49,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:44:49,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:44:49,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:44:49,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:44:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:44:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 506626490, now seen corresponding path program 2 times [2024-11-22 21:44:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:44:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849662725] [2024-11-22 21:44:49,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:44:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:44:49,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:44:49,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:44:49,395 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:44:49,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:44:49,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849662725] [2024-11-22 21:44:49,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849662725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:44:49,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:44:49,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:44:49,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258754287] [2024-11-22 21:44:49,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:44:49,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:44:49,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:44:49,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:44:49,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:44:49,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2024-11-22 21:44:49,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:49,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:44:49,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2024-11-22 21:44:49,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:44:50,510 INFO L124 PetriNetUnfolderBase]: 13081/18814 cut-off events. [2024-11-22 21:44:50,510 INFO L125 PetriNetUnfolderBase]: For 1234/1234 co-relation queries the response was YES. [2024-11-22 21:44:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37572 conditions, 18814 events. 13081/18814 cut-off events. For 1234/1234 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 113641 event pairs, 7989 based on Foata normal form. 316/17880 useless extension candidates. Maximal degree in co-relation 15654. Up to 13117 conditions per place. [2024-11-22 21:44:50,588 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 68 selfloop transitions, 4 changer transitions 0/91 dead transitions. [2024-11-22 21:44:50,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 369 flow [2024-11-22 21:44:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:44:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:44:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2024-11-22 21:44:50,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-11-22 21:44:50,590 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 168 flow. Second operand 3 states and 151 transitions. [2024-11-22 21:44:50,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 369 flow [2024-11-22 21:44:50,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:44:50,593 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 174 flow [2024-11-22 21:44:50,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-11-22 21:44:50,594 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2024-11-22 21:44:50,594 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 174 flow [2024-11-22 21:44:50,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:50,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:44:50,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:44:50,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:44:50,595 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:44:50,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:44:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2103626852, now seen corresponding path program 3 times [2024-11-22 21:44:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:44:50,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200950429] [2024-11-22 21:44:50,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:44:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:44:50,623 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-22 21:44:50,623 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:44:50,732 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:44:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:44:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200950429] [2024-11-22 21:44:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200950429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:44:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:44:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:44:50,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505858287] [2024-11-22 21:44:50,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:44:50,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:44:50,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:44:50,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:44:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:44:50,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2024-11-22 21:44:50,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:50,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:44:50,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2024-11-22 21:44:50,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:44:51,679 INFO L124 PetriNetUnfolderBase]: 11919/16775 cut-off events. [2024-11-22 21:44:51,679 INFO L125 PetriNetUnfolderBase]: For 1661/1683 co-relation queries the response was YES. [2024-11-22 21:44:51,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34598 conditions, 16775 events. 11919/16775 cut-off events. For 1661/1683 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 94819 event pairs, 7037 based on Foata normal form. 251/16050 useless extension candidates. Maximal degree in co-relation 13404. Up to 11081 conditions per place. [2024-11-22 21:44:51,735 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 69 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2024-11-22 21:44:51,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 379 flow [2024-11-22 21:44:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:44:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:44:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2024-11-22 21:44:51,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-11-22 21:44:51,737 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 174 flow. Second operand 3 states and 152 transitions. [2024-11-22 21:44:51,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 379 flow [2024-11-22 21:44:51,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:44:51,739 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 180 flow [2024-11-22 21:44:51,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2024-11-22 21:44:51,740 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2024-11-22 21:44:51,740 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 180 flow [2024-11-22 21:44:51,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:51,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:44:51,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:44:51,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:44:51,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:44:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:44:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1531433938, now seen corresponding path program 4 times [2024-11-22 21:44:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:44:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305785736] [2024-11-22 21:44:51,742 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 21:44:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:44:51,771 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 21:44:51,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:44:52,614 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:44:52,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:44:52,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305785736] [2024-11-22 21:44:52,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305785736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:44:52,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:44:52,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-22 21:44:52,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030169853] [2024-11-22 21:44:52,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:44:52,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:44:52,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:44:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:44:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-11-22 21:44:52,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2024-11-22 21:44:52,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 180 flow. Second operand has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:44:52,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:44:52,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2024-11-22 21:44:52,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:44:58,500 INFO L124 PetriNetUnfolderBase]: 56859/77026 cut-off events. [2024-11-22 21:44:58,500 INFO L125 PetriNetUnfolderBase]: For 9414/9414 co-relation queries the response was YES. [2024-11-22 21:44:58,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161828 conditions, 77026 events. 56859/77026 cut-off events. For 9414/9414 co-relation queries the response was YES. Maximal size of possible extension queue 1664. Compared 444952 event pairs, 5252 based on Foata normal form. 1/74107 useless extension candidates. Maximal degree in co-relation 82053. Up to 30832 conditions per place. [2024-11-22 21:44:58,851 INFO L140 encePairwiseOnDemand]: 68/88 looper letters, 437 selfloop transitions, 102 changer transitions 44/593 dead transitions. [2024-11-22 21:44:58,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 593 transitions, 2631 flow [2024-11-22 21:44:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 21:44:58,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-11-22 21:44:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 1213 transitions. [2024-11-22 21:44:58,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3725429975429975 [2024-11-22 21:44:58,857 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 180 flow. Second operand 37 states and 1213 transitions. [2024-11-22 21:44:58,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 593 transitions, 2631 flow [2024-11-22 21:44:58,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 593 transitions, 2599 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:44:58,963 INFO L231 Difference]: Finished difference. Result has 128 places, 178 transitions, 816 flow [2024-11-22 21:44:58,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=816, PETRI_PLACES=128, PETRI_TRANSITIONS=178} [2024-11-22 21:44:58,964 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 42 predicate places. [2024-11-22 21:44:58,964 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 178 transitions, 816 flow [2024-11-22 21:44:58,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:44:58,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:44:58,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:44:58,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 21:44:58,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:44:58,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:44:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1250733070, now seen corresponding path program 5 times [2024-11-22 21:44:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:44:58,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043451432] [2024-11-22 21:44:58,967 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 21:44:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:44:58,983 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:44:58,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:44:59,058 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:44:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:44:59,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043451432] [2024-11-22 21:44:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043451432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:44:59,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:44:59,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:44:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480335441] [2024-11-22 21:44:59,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:44:59,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:44:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:44:59,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:44:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:44:59,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 88 [2024-11-22 21:44:59,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 178 transitions, 816 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:44:59,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:44:59,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 88 [2024-11-22 21:44:59,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:45:00,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), 209#true, Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 46#L76-4true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true]) [2024-11-22 21:45:00,918 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,918 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,919 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,919 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), 209#true, Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:00,919 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,919 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,919 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,920 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is not cut-off event [2024-11-22 21:45:00,980 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 114#true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true]) [2024-11-22 21:45:00,980 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,980 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,980 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,980 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 114#true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:00,981 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,981 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,981 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:00,981 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true]) [2024-11-22 21:45:01,001 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,002 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,002 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 46#L76-4true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true]) [2024-11-22 21:45:01,011 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,011 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,011 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,011 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,012 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,012 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,012 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,012 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true]) [2024-11-22 21:45:01,058 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 74#L115-4true, 12#L77true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,058 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,058 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true]) [2024-11-22 21:45:01,066 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 46#L76-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,067 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,067 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, 18#L116true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true]) [2024-11-22 21:45:01,083 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,083 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,083 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,083 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 18#L116true, 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 15#L143-4true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,084 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,084 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is not cut-off event [2024-11-22 21:45:01,137 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L61-->L65: Formula: (and (= v_~temp_5~0_39 v_~x_0~0_72) (not (= (ite (and (not (= (mod v_~f2_3~0_53 256) 0)) (not (= (mod v_~f1_2~0_55 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, ~x_0~0=v_~x_0~0_72} OutVars{~f1_2~0=v_~f1_2~0_55, ~f2_3~0=v_~f2_3~0_53, thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, ~x_0~0=v_~x_0~0_72, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~temp_5~0=v_~temp_5~0_39} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~temp_5~0][105], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), 22#L48true, 82#L65true, Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true]) [2024-11-22 21:45:01,138 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([510] L48-->L52: Formula: (and (= v_~temp_4~0_49 v_~y_1~0_64) (not (= (ite (and (not (= (mod v_~f1_2~0_51 256) 0)) (not (= (mod v_~f2_3~0_49 256) 0))) 1 0) 0))) InVars {~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, ~y_1~0=v_~y_1~0_64} OutVars{~temp_4~0=v_~temp_4~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f1_2~0=v_~f1_2~0_51, ~f2_3~0=v_~f2_3~0_49, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~y_1~0=v_~y_1~0_64} AuxVars[] AssignedVars[~temp_4~0, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][106], [Black: 120#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0)), Black: 139#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_10~0 ~x_0~0)), Black: 161#(and (= ~y_7~0 (+ ~temp_5~0 1)) (or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))) (= (+ ~temp_4~0 2) ~x_6~0)), 18#L116true, Black: 122#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1))), 114#true, Black: 137#(and (= ~y_1~0 0) (= ~x_0~0 ~x_6~0) (= ~y_7~0 0) (= ~temp_10~0 ~x_0~0)), 20#L52true, Black: 157#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 149#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0)), Black: 151#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 153#(and (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 155#(and (= ~y_7~0 (+ ~temp_5~0 1)) (= ~temp_11~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~x_0~0 2) ~x_6~0) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 119#(or (= ~y_7~0 0) (not (= ~y_1~0 ~y_7~0)) (not (= ~x_0~0 ~x_6~0))), Black: 147#(and (= ~temp_11~0 (+ ~x_0~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 185#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1))), Black: 179#(and (= ~x_6~0 (+ ~temp_5~0 1)) (= ~x_6~0 (+ ~x_0~0 1)) (= ~y_7~0 (+ ~y_1~0 1)) (= (+ ~temp_4~0 2) ~x_6~0)), Black: 141#(and (= ~y_1~0 0) (= ~y_7~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0) (= ~temp_10~0 ~x_0~0)), 209#true, Black: 143#(and (= ~y_1~0 0) (= ~y_7~0 1) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 123#(and (= ~y_1~0 0) (= ~x_6~0 (+ ~x_0~0 1)) (= ~temp_11~0 0)), Black: 104#(= (mod ~f2_3~0 256) 0), Black: 108#(= (mod ~f1_8~0 256) 0), 10#L144true, Black: 112#(= (mod ~f1_2~0 256) 0), 4#thread6EXITtrue, 12#L77true, 76#L91-1true, 64#L61true]) [2024-11-22 21:45:01,138 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,138 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is not cut-off event [2024-11-22 21:45:01,720 INFO L124 PetriNetUnfolderBase]: 24273/36249 cut-off events. [2024-11-22 21:45:01,720 INFO L125 PetriNetUnfolderBase]: For 53803/54191 co-relation queries the response was YES. [2024-11-22 21:45:01,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97395 conditions, 36249 events. 24273/36249 cut-off events. For 53803/54191 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 245409 event pairs, 12894 based on Foata normal form. 1030/34394 useless extension candidates. Maximal degree in co-relation 80365. Up to 24200 conditions per place. [2024-11-22 21:45:02,017 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 95 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2024-11-22 21:45:02,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 184 transitions, 1014 flow [2024-11-22 21:45:02,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:45:02,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:45:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-11-22 21:45:02,019 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2024-11-22 21:45:02,019 INFO L175 Difference]: Start difference. First operand has 128 places, 178 transitions, 816 flow. Second operand 3 states and 149 transitions. [2024-11-22 21:45:02,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 184 transitions, 1014 flow [2024-11-22 21:45:02,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 184 transitions, 1004 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-22 21:45:02,596 INFO L231 Difference]: Finished difference. Result has 125 places, 162 transitions, 743 flow [2024-11-22 21:45:02,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=743, PETRI_PLACES=125, PETRI_TRANSITIONS=162} [2024-11-22 21:45:02,597 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 39 predicate places. [2024-11-22 21:45:02,597 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 162 transitions, 743 flow [2024-11-22 21:45:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:45:02,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:45:02,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:45:02,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 21:45:02,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:45:02,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:45:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1905238980, now seen corresponding path program 6 times [2024-11-22 21:45:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:45:02,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598402607] [2024-11-22 21:45:02,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-22 21:45:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:45:02,615 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-22 21:45:02,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:45:03,121 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:45:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:45:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598402607] [2024-11-22 21:45:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598402607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:45:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:45:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-22 21:45:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848593317] [2024-11-22 21:45:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:45:03,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 21:45:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:45:03,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 21:45:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-22 21:45:03,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2024-11-22 21:45:03,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 162 transitions, 743 flow. Second operand has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:45:03,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:45:03,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2024-11-22 21:45:03,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:45:10,509 INFO L124 PetriNetUnfolderBase]: 57558/78041 cut-off events. [2024-11-22 21:45:10,509 INFO L125 PetriNetUnfolderBase]: For 100171/100171 co-relation queries the response was YES. [2024-11-22 21:45:10,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221798 conditions, 78041 events. 57558/78041 cut-off events. For 100171/100171 co-relation queries the response was YES. Maximal size of possible extension queue 1598. Compared 443151 event pairs, 6273 based on Foata normal form. 1/75176 useless extension candidates. Maximal degree in co-relation 148246. Up to 42726 conditions per place. [2024-11-22 21:45:11,182 INFO L140 encePairwiseOnDemand]: 64/88 looper letters, 704 selfloop transitions, 241 changer transitions 20/975 dead transitions. [2024-11-22 21:45:11,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 975 transitions, 5433 flow [2024-11-22 21:45:11,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-22 21:45:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2024-11-22 21:45:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 2025 transitions. [2024-11-22 21:45:11,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3384024064171123 [2024-11-22 21:45:11,189 INFO L175 Difference]: Start difference. First operand has 125 places, 162 transitions, 743 flow. Second operand 68 states and 2025 transitions. [2024-11-22 21:45:11,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 975 transitions, 5433 flow [2024-11-22 21:45:13,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 975 transitions, 5357 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-22 21:45:13,208 INFO L231 Difference]: Finished difference. Result has 217 places, 395 transitions, 2600 flow [2024-11-22 21:45:13,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=2600, PETRI_PLACES=217, PETRI_TRANSITIONS=395} [2024-11-22 21:45:13,209 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 131 predicate places. [2024-11-22 21:45:13,209 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 395 transitions, 2600 flow [2024-11-22 21:45:13,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 19.5) internal successors, (429), 22 states have internal predecessors, (429), 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:45:13,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:45:13,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:45:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:45:13,210 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:45:13,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:45:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1067824980, now seen corresponding path program 7 times [2024-11-22 21:45:13,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:45:13,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954898217] [2024-11-22 21:45:13,211 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-22 21:45:13,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:45:13,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:45:13,854 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:45:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:45:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954898217] [2024-11-22 21:45:13,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954898217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:45:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:45:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-22 21:45:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771375358] [2024-11-22 21:45:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:45:13,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 21:45:13,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:45:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 21:45:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:45:13,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2024-11-22 21:45:13,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 395 transitions, 2600 flow. Second operand has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:45:13,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:45:13,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2024-11-22 21:45:13,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:45:24,777 INFO L124 PetriNetUnfolderBase]: 68627/92980 cut-off events. [2024-11-22 21:45:24,777 INFO L125 PetriNetUnfolderBase]: For 394239/394239 co-relation queries the response was YES. [2024-11-22 21:45:25,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328302 conditions, 92980 events. 68627/92980 cut-off events. For 394239/394239 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 537651 event pairs, 9356 based on Foata normal form. 1/89431 useless extension candidates. Maximal degree in co-relation 328231. Up to 50914 conditions per place. [2024-11-22 21:45:25,643 INFO L140 encePairwiseOnDemand]: 65/88 looper letters, 686 selfloop transitions, 344 changer transitions 33/1073 dead transitions. [2024-11-22 21:45:25,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1073 transitions, 8084 flow [2024-11-22 21:45:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-22 21:45:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2024-11-22 21:45:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1755 transitions. [2024-11-22 21:45:25,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31655844155844154 [2024-11-22 21:45:25,647 INFO L175 Difference]: Start difference. First operand has 217 places, 395 transitions, 2600 flow. Second operand 63 states and 1755 transitions. [2024-11-22 21:45:25,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1073 transitions, 8084 flow [2024-11-22 21:45:32,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 1073 transitions, 7361 flow, removed 278 selfloop flow, removed 3 redundant places. [2024-11-22 21:45:32,425 INFO L231 Difference]: Finished difference. Result has 302 places, 640 transitions, 5029 flow [2024-11-22 21:45:32,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=2123, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5029, PETRI_PLACES=302, PETRI_TRANSITIONS=640} [2024-11-22 21:45:32,426 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 216 predicate places. [2024-11-22 21:45:32,426 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 640 transitions, 5029 flow [2024-11-22 21:45:32,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:45:32,427 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:45:32,427 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:45:32,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:45:32,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 9 more)] === [2024-11-22 21:45:32,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:45:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -619197446, now seen corresponding path program 8 times [2024-11-22 21:45:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:45:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706152153] [2024-11-22 21:45:32,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:45:32,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:45:32,442 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:45:32,443 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:45:32,883 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:45:32,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:45:32,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706152153] [2024-11-22 21:45:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706152153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:45:32,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:45:32,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-22 21:45:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96431918] [2024-11-22 21:45:32,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:45:32,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 21:45:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:45:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 21:45:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-22 21:45:32,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 88 [2024-11-22 21:45:32,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 640 transitions, 5029 flow. Second operand has 21 states, 21 states have (on average 19.61904761904762) internal successors, (412), 21 states have internal predecessors, (412), 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:45:32,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:45:32,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 88 [2024-11-22 21:45:32,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand