./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI --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 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-24 22:06:04,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 22:06:04,382 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-24 22:06:04,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 22:06:04,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 22:06:04,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 22:06:04,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 22:06:04,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 22:06:04,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-24 22:06:04,443 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-24 22:06:04,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 22:06:04,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 22:06:04,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 22:06:04,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 22:06:04,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 22:06:04,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 22:06:04,450 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 22:06:04,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 22:06:04,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 22:06:04,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 22:06:04,453 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-24 22:06:04,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-24 22:06:04,454 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-24 22:06:04,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 22:06:04,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-24 22:06:04,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-24 22:06:04,456 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 22:06:04,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 22:06:04,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 22:06:04,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 22:06:04,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 22:06:04,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 22:06:04,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:06:04,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 22:06:04,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 22:06:04,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 22:06:04,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 22:06:04,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 22:06:04,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-24 22:06:04,462 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-24 22:06:04,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 22:06:04,463 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI 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 -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2023-11-24 22:06:04,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 22:06:04,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 22:06:04,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 22:06:04,838 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 22:06:04,838 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 22:06:04,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2023-11-24 22:06:08,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 22:06:08,237 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 22:06:08,238 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2023-11-24 22:06:08,247 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/data/19f298418/0d3ed8e8e236496ba2017d6b86a594c1/FLAG20db7827d [2023-11-24 22:06:08,263 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/data/19f298418/0d3ed8e8e236496ba2017d6b86a594c1 [2023-11-24 22:06:08,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 22:06:08,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 22:06:08,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 22:06:08,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 22:06:08,276 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 22:06:08,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115ea3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08, skipping insertion in model container [2023-11-24 22:06:08,278 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 22:06:08,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:06:08,523 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 22:06:08,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 22:06:08,558 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:06:08,558 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 22:06:08,567 INFO L206 MainTranslator]: Completed translation [2023-11-24 22:06:08,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08 WrapperNode [2023-11-24 22:06:08,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 22:06:08,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 22:06:08,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 22:06:08,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 22:06:08,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,611 INFO L138 Inliner]: procedures = 22, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2023-11-24 22:06:08,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 22:06:08,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 22:06:08,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 22:06:08,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 22:06:08,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,673 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-24 22:06:08,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,686 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 22:06:08,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 22:06:08,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 22:06:08,714 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 22:06:08,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (1/1) ... [2023-11-24 22:06:08,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-24 22:06:08,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:06:08,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-24 22:06:08,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-24 22:06:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 22:06:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-24 22:06:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-24 22:06:08,816 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-24 22:06:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-24 22:06:08,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-24 22:06:08,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-24 22:06:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-24 22:06:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-24 22:06:08,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-24 22:06:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-24 22:06:08,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 22:06:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-24 22:06:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-24 22:06:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-24 22:06:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-24 22:06:08,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 22:06:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 22:06:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 22:06:08,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 22:06:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-24 22:06:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-24 22:06:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-24 22:06:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-24 22:06:08,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 22:06:08,825 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 22:06:09,030 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 22:06:09,033 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 22:06:09,470 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 22:06:09,609 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 22:06:09,609 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 22:06:09,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:06:09 BoogieIcfgContainer [2023-11-24 22:06:09,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 22:06:09,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 22:06:09,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 22:06:09,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 22:06:09,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 10:06:08" (1/3) ... [2023-11-24 22:06:09,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359022cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:06:09, skipping insertion in model container [2023-11-24 22:06:09,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 10:06:08" (2/3) ... [2023-11-24 22:06:09,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359022cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 10:06:09, skipping insertion in model container [2023-11-24 22:06:09,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 10:06:09" (3/3) ... [2023-11-24 22:06:09,621 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2023-11-24 22:06:09,642 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 22:06:09,643 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-24 22:06:09,643 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 22:06:09,701 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-24 22:06:09,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 145 flow [2023-11-24 22:06:09,777 INFO L124 PetriNetUnfolderBase]: 6/59 cut-off events. [2023-11-24 22:06:09,777 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-24 22:06:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 59 events. 6/59 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-11-24 22:06:09,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 62 transitions, 145 flow [2023-11-24 22:06:09,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 134 flow [2023-11-24 22:06:09,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-24 22:06:09,807 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@f99248d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 22:06:09,808 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2023-11-24 22:06:09,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-24 22:06:09,817 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-24 22:06:09,817 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-24 22:06:09,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:09,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:06:09,819 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:09,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash 11731, now seen corresponding path program 1 times [2023-11-24 22:06:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:09,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462896349] [2023-11-24 22:06:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:10,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462896349] [2023-11-24 22:06:10,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462896349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:10,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:10,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137782942] [2023-11-24 22:06:10,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:10,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:10,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:10,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:10,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:10,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:10,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:10,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:10,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:10,716 INFO L124 PetriNetUnfolderBase]: 525/933 cut-off events. [2023-11-24 22:06:10,716 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-11-24 22:06:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 933 events. 525/933 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4636 event pairs, 211 based on Foata normal form. 1/769 useless extension candidates. Maximal degree in co-relation 1463. Up to 638 conditions per place. [2023-11-24 22:06:10,740 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-11-24 22:06:10,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 168 flow [2023-11-24 22:06:10,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:10,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2023-11-24 22:06:10,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7258064516129032 [2023-11-24 22:06:10,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 135 transitions. [2023-11-24 22:06:10,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 135 transitions. [2023-11-24 22:06:10,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:10,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 135 transitions. [2023-11-24 22:06:10,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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) [2023-11-24 22:06:10,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:10,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:10,782 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 134 flow. Second operand 3 states and 135 transitions. [2023-11-24 22:06:10,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 168 flow [2023-11-24 22:06:10,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 156 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-24 22:06:10,796 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 116 flow [2023-11-24 22:06:10,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2023-11-24 22:06:10,803 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2023-11-24 22:06:10,804 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 116 flow [2023-11-24 22:06:10,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:10,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:10,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-24 22:06:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 22:06:10,806 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:10,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash 11732, now seen corresponding path program 1 times [2023-11-24 22:06:10,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:10,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894163832] [2023-11-24 22:06:10,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:10,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:11,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894163832] [2023-11-24 22:06:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894163832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864667827] [2023-11-24 22:06:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:11,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:11,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-24 22:06:11,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-24 22:06:11,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:11,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-24 22:06:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:11,254 INFO L124 PetriNetUnfolderBase]: 366/737 cut-off events. [2023-11-24 22:06:11,255 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 22:06:11,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 737 events. 366/737 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3760 event pairs, 136 based on Foata normal form. 37/633 useless extension candidates. Maximal degree in co-relation 1194. Up to 442 conditions per place. [2023-11-24 22:06:11,267 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-11-24 22:06:11,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 150 flow [2023-11-24 22:06:11,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:11,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-24 22:06:11,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-24 22:06:11,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:11,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2023-11-24 22:06:11,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,286 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-24 22:06:11,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 150 flow [2023-11-24 22:06:11,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:11,290 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 113 flow [2023-11-24 22:06:11,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2023-11-24 22:06:11,297 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-24 22:06:11,298 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 113 flow [2023-11-24 22:06:11,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2023-11-24 22:06:11,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:11,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:06:11,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 22:06:11,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:11,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 349842003, now seen corresponding path program 1 times [2023-11-24 22:06:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647406569] [2023-11-24 22:06:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:11,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647406569] [2023-11-24 22:06:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647406569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:11,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:11,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048217421] [2023-11-24 22:06:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:11,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:11,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:11,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2023-11-24 22:06:11,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:11,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:11,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:11,602 INFO L124 PetriNetUnfolderBase]: 397/760 cut-off events. [2023-11-24 22:06:11,602 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-24 22:06:11,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 760 events. 397/760 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3797 event pairs, 151 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1261. Up to 486 conditions per place. [2023-11-24 22:06:11,612 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-11-24 22:06:11,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 151 flow [2023-11-24 22:06:11,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-24 22:06:11,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2023-11-24 22:06:11,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-24 22:06:11,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-24 22:06:11,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:11,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-24 22:06:11,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2023-11-24 22:06:11,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,617 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 113 flow. Second operand 3 states and 134 transitions. [2023-11-24 22:06:11,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 151 flow [2023-11-24 22:06:11,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:11,619 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 110 flow [2023-11-24 22:06:11,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-24 22:06:11,621 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-11-24 22:06:11,621 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 110 flow [2023-11-24 22:06:11,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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) [2023-11-24 22:06:11,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:11,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-24 22:06:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 22:06:11,622 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:11,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 349842004, now seen corresponding path program 1 times [2023-11-24 22:06:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:11,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752539639] [2023-11-24 22:06:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:11,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:11,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:11,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752539639] [2023-11-24 22:06:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752539639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:11,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121306618] [2023-11-24 22:06:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:11,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-24 22:06:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:11,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-24 22:06:11,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:11,850 INFO L124 PetriNetUnfolderBase]: 366/713 cut-off events. [2023-11-24 22:06:11,850 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 22:06:11,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 713 events. 366/713 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3546 event pairs, 136 based on Foata normal form. 13/609 useless extension candidates. Maximal degree in co-relation 1170. Up to 442 conditions per place. [2023-11-24 22:06:11,860 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-24 22:06:11,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 144 flow [2023-11-24 22:06:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-24 22:06:11,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-24 22:06:11,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:11,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-24 22:06:11,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2023-11-24 22:06:11,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,864 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 110 flow. Second operand 3 states and 138 transitions. [2023-11-24 22:06:11,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 144 flow [2023-11-24 22:06:11,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 143 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:11,866 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 107 flow [2023-11-24 22:06:11,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-24 22:06:11,868 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2023-11-24 22:06:11,868 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 107 flow [2023-11-24 22:06:11,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:11,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:11,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-24 22:06:11,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:11,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:11,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1742153433, now seen corresponding path program 1 times [2023-11-24 22:06:11,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:11,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652255150] [2023-11-24 22:06:11,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:11,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:11,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652255150] [2023-11-24 22:06:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652255150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807109618] [2023-11-24 22:06:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:11,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:11,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:11,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:11,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:11,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:12,093 INFO L124 PetriNetUnfolderBase]: 397/735 cut-off events. [2023-11-24 22:06:12,093 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-24 22:06:12,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 735 events. 397/735 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3548 event pairs, 152 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 1234. Up to 484 conditions per place. [2023-11-24 22:06:12,103 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 20 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-24 22:06:12,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 145 flow [2023-11-24 22:06:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-24 22:06:12,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7204301075268817 [2023-11-24 22:06:12,105 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-24 22:06:12,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-24 22:06:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:12,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-24 22:06:12,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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) [2023-11-24 22:06:12,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,108 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 107 flow. Second operand 3 states and 134 transitions. [2023-11-24 22:06:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 145 flow [2023-11-24 22:06:12,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 46 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:12,111 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 104 flow [2023-11-24 22:06:12,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-11-24 22:06:12,112 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -12 predicate places. [2023-11-24 22:06:12,112 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 104 flow [2023-11-24 22:06:12,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:12,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:12,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-24 22:06:12,113 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:12,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1742153432, now seen corresponding path program 1 times [2023-11-24 22:06:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560773109] [2023-11-24 22:06:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:12,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:12,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560773109] [2023-11-24 22:06:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560773109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:12,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:12,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-24 22:06:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319721641] [2023-11-24 22:06:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:12,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:12,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-24 22:06:12,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2023-11-24 22:06:12,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:12,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-24 22:06:12,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:12,352 INFO L124 PetriNetUnfolderBase]: 366/695 cut-off events. [2023-11-24 22:06:12,352 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-24 22:06:12,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 695 events. 366/695 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3359 event pairs, 136 based on Foata normal form. 15/611 useless extension candidates. Maximal degree in co-relation 1152. Up to 442 conditions per place. [2023-11-24 22:06:12,361 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 18 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-24 22:06:12,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 138 flow [2023-11-24 22:06:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:12,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-24 22:06:12,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2023-11-24 22:06:12,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-24 22:06:12,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-24 22:06:12,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:12,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-24 22:06:12,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2023-11-24 22:06:12,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,365 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 104 flow. Second operand 3 states and 138 transitions. [2023-11-24 22:06:12,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 138 flow [2023-11-24 22:06:12,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:12,368 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 101 flow [2023-11-24 22:06:12,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-11-24 22:06:12,372 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -13 predicate places. [2023-11-24 22:06:12,372 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 101 flow [2023-11-24 22:06:12,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2023-11-24 22:06:12,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:12,374 INFO L208 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] [2023-11-24 22:06:12,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-24 22:06:12,374 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:12,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash 606349923, now seen corresponding path program 1 times [2023-11-24 22:06:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270877458] [2023-11-24 22:06:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:12,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:12,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:12,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:12,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270877458] [2023-11-24 22:06:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270877458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:12,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:12,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:06:12,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472258669] [2023-11-24 22:06:12,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:12,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:12,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:12,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:12,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:12,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:12,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:12,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:12,691 INFO L124 PetriNetUnfolderBase]: 872/1433 cut-off events. [2023-11-24 22:06:12,691 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-24 22:06:12,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 1433 events. 872/1433 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6973 event pairs, 86 based on Foata normal form. 1/1288 useless extension candidates. Maximal degree in co-relation 2548. Up to 1025 conditions per place. [2023-11-24 22:06:12,705 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 32 selfloop transitions, 7 changer transitions 1/61 dead transitions. [2023-11-24 22:06:12,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 220 flow [2023-11-24 22:06:12,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-24 22:06:12,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8172043010752689 [2023-11-24 22:06:12,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-24 22:06:12,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-24 22:06:12,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:12,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-24 22:06:12,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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) [2023-11-24 22:06:12,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,709 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,710 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 101 flow. Second operand 3 states and 152 transitions. [2023-11-24 22:06:12,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 220 flow [2023-11-24 22:06:12,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:12,712 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 147 flow [2023-11-24 22:06:12,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-11-24 22:06:12,713 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2023-11-24 22:06:12,713 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 147 flow [2023-11-24 22:06:12,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:12,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:12,714 INFO L208 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] [2023-11-24 22:06:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-24 22:06:12,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:12,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash 107185241, now seen corresponding path program 1 times [2023-11-24 22:06:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:12,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28144795] [2023-11-24 22:06:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:12,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:12,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28144795] [2023-11-24 22:06:12,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28144795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:12,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:12,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:06:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9616655] [2023-11-24 22:06:12,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:12,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:12,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:12,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:12,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:12,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-24 22:06:12,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2023-11-24 22:06:12,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:12,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-24 22:06:12,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:12,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 4#L121-4true, 93#true]) [2023-11-24 22:06:12,918 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,918 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,919 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-24 22:06:12,919 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 4#L121-4true, 93#true]) [2023-11-24 22:06:12,919 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,919 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,919 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-24 22:06:12,920 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-24 22:06:12,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 93#true]) [2023-11-24 22:06:12,934 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,934 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,934 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,934 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-24 22:06:12,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 52#thread3EXITtrue, 93#true]) [2023-11-24 22:06:12,935 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,935 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-24 22:06:12,935 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,935 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-24 22:06:12,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 100#(= ~g2~0 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 22#$Ultimate##0true, 93#true]) [2023-11-24 22:06:12,964 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,964 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:12,964 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-24 22:06:12,964 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:12,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 22#$Ultimate##0true, 93#true]) [2023-11-24 22:06:12,965 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,965 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:12,965 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-24 22:06:12,966 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:12,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 93#true]) [2023-11-24 22:06:12,987 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,987 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,987 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,987 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:12,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][26], [75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), 8#L72true, 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 14#L94true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 93#true]) [2023-11-24 22:06:12,988 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,988 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,988 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-24 22:06:12,988 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-24 22:06:13,013 INFO L124 PetriNetUnfolderBase]: 710/1219 cut-off events. [2023-11-24 22:06:13,013 INFO L125 PetriNetUnfolderBase]: For 258/312 co-relation queries the response was YES. [2023-11-24 22:06:13,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 1219 events. 710/1219 cut-off events. For 258/312 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5968 event pairs, 78 based on Foata normal form. 46/1092 useless extension candidates. Maximal degree in co-relation 2447. Up to 466 conditions per place. [2023-11-24 22:06:13,028 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-24 22:06:13,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 239 flow [2023-11-24 22:06:13,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-24 22:06:13,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8279569892473119 [2023-11-24 22:06:13,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-24 22:06:13,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-24 22:06:13,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:13,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-24 22:06:13,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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) [2023-11-24 22:06:13,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,032 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 147 flow. Second operand 3 states and 154 transitions. [2023-11-24 22:06:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 239 flow [2023-11-24 22:06:13,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 230 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:13,035 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 150 flow [2023-11-24 22:06:13,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-11-24 22:06:13,036 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -9 predicate places. [2023-11-24 22:06:13,036 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 150 flow [2023-11-24 22:06:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2023-11-24 22:06:13,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:13,037 INFO L208 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] [2023-11-24 22:06:13,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-24 22:06:13,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:13,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1651099231, now seen corresponding path program 1 times [2023-11-24 22:06:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102628953] [2023-11-24 22:06:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102628953] [2023-11-24 22:06:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102628953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:06:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462449458] [2023-11-24 22:06:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:13,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:13,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-24 22:06:13,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2023-11-24 22:06:13,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:13,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-24 22:06:13,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:13,329 INFO L124 PetriNetUnfolderBase]: 792/1332 cut-off events. [2023-11-24 22:06:13,329 INFO L125 PetriNetUnfolderBase]: For 482/698 co-relation queries the response was YES. [2023-11-24 22:06:13,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1332 events. 792/1332 cut-off events. For 482/698 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6713 event pairs, 102 based on Foata normal form. 47/1160 useless extension candidates. Maximal degree in co-relation 2976. Up to 619 conditions per place. [2023-11-24 22:06:13,371 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 22:06:13,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 259 flow [2023-11-24 22:06:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2023-11-24 22:06:13,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2023-11-24 22:06:13,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 155 transitions. [2023-11-24 22:06:13,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 155 transitions. [2023-11-24 22:06:13,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:13,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 155 transitions. [2023-11-24 22:06:13,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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) [2023-11-24 22:06:13,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,375 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 150 flow. Second operand 3 states and 155 transitions. [2023-11-24 22:06:13,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 259 flow [2023-11-24 22:06:13,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:13,380 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 160 flow [2023-11-24 22:06:13,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-11-24 22:06:13,382 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2023-11-24 22:06:13,382 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 160 flow [2023-11-24 22:06:13,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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) [2023-11-24 22:06:13,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:13,383 INFO L208 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] [2023-11-24 22:06:13,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-24 22:06:13,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:13,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1253021295, now seen corresponding path program 1 times [2023-11-24 22:06:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022017215] [2023-11-24 22:06:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:13,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:13,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022017215] [2023-11-24 22:06:13,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022017215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:13,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:13,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:06:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710216108] [2023-11-24 22:06:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:13,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:13,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:13,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:13,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 62 [2023-11-24 22:06:13,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2023-11-24 22:06:13,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:13,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 62 [2023-11-24 22:06:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:13,836 INFO L124 PetriNetUnfolderBase]: 942/1557 cut-off events. [2023-11-24 22:06:13,836 INFO L125 PetriNetUnfolderBase]: For 655/771 co-relation queries the response was YES. [2023-11-24 22:06:13,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3588 conditions, 1557 events. 942/1557 cut-off events. For 655/771 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7724 event pairs, 181 based on Foata normal form. 48/1311 useless extension candidates. Maximal degree in co-relation 3571. Up to 575 conditions per place. [2023-11-24 22:06:13,874 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 33 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-24 22:06:13,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 273 flow [2023-11-24 22:06:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2023-11-24 22:06:13,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-24 22:06:13,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 153 transitions. [2023-11-24 22:06:13,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 153 transitions. [2023-11-24 22:06:13,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:13,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 153 transitions. [2023-11-24 22:06:13,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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) [2023-11-24 22:06:13,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:13,878 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 160 flow. Second operand 3 states and 153 transitions. [2023-11-24 22:06:13,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 273 flow [2023-11-24 22:06:13,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:13,881 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 170 flow [2023-11-24 22:06:13,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-11-24 22:06:13,882 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2023-11-24 22:06:13,882 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 170 flow [2023-11-24 22:06:13,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 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) [2023-11-24 22:06:13,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:13,883 INFO L208 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] [2023-11-24 22:06:13,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-24 22:06:13,883 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:13,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:13,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1333071905, now seen corresponding path program 1 times [2023-11-24 22:06:13,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:13,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912512344] [2023-11-24 22:06:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:14,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:14,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912512344] [2023-11-24 22:06:14,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912512344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:14,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:14,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 22:06:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757377065] [2023-11-24 22:06:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-24 22:06:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-24 22:06:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-24 22:06:14,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 62 [2023-11-24 22:06:14,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2023-11-24 22:06:14,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:14,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 62 [2023-11-24 22:06:14,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:14,324 INFO L124 PetriNetUnfolderBase]: 1081/1701 cut-off events. [2023-11-24 22:06:14,325 INFO L125 PetriNetUnfolderBase]: For 891/1009 co-relation queries the response was YES. [2023-11-24 22:06:14,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 1701 events. 1081/1701 cut-off events. For 891/1009 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8072 event pairs, 190 based on Foata normal form. 31/1480 useless extension candidates. Maximal degree in co-relation 4226. Up to 756 conditions per place. [2023-11-24 22:06:14,349 INFO L140 encePairwiseOnDemand]: 59/62 looper letters, 34 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-24 22:06:14,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 63 transitions, 278 flow [2023-11-24 22:06:14,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-24 22:06:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-24 22:06:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-11-24 22:06:14,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8118279569892473 [2023-11-24 22:06:14,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-11-24 22:06:14,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-11-24 22:06:14,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:14,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-11-24 22:06:14,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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) [2023-11-24 22:06:14,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:14,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:14,354 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 170 flow. Second operand 3 states and 151 transitions. [2023-11-24 22:06:14,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 63 transitions, 278 flow [2023-11-24 22:06:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:14,360 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 172 flow [2023-11-24 22:06:14,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-24 22:06:14,361 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-24 22:06:14,361 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 172 flow [2023-11-24 22:06:14,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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) [2023-11-24 22:06:14,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:14,362 INFO L208 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] [2023-11-24 22:06:14,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-24 22:06:14,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:14,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:14,363 INFO L85 PathProgramCache]: Analyzing trace with hash 304995005, now seen corresponding path program 1 times [2023-11-24 22:06:14,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:14,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615895379] [2023-11-24 22:06:14,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:14,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 22:06:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615895379] [2023-11-24 22:06:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615895379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:06:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589486408] [2023-11-24 22:06:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:14,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:06:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:06:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:06:14,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-24 22:06:14,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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) [2023-11-24 22:06:14,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:14,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-24 22:06:14,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:15,346 INFO L124 PetriNetUnfolderBase]: 2117/3306 cut-off events. [2023-11-24 22:06:15,347 INFO L125 PetriNetUnfolderBase]: For 2019/2069 co-relation queries the response was YES. [2023-11-24 22:06:15,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8465 conditions, 3306 events. 2117/3306 cut-off events. For 2019/2069 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17894 event pairs, 402 based on Foata normal form. 65/2933 useless extension candidates. Maximal degree in co-relation 8444. Up to 1105 conditions per place. [2023-11-24 22:06:15,390 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 50 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-24 22:06:15,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 382 flow [2023-11-24 22:06:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:06:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:06:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2023-11-24 22:06:15,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-24 22:06:15,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 204 transitions. [2023-11-24 22:06:15,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 204 transitions. [2023-11-24 22:06:15,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:15,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 204 transitions. [2023-11-24 22:06:15,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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) [2023-11-24 22:06:15,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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) [2023-11-24 22:06:15,398 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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) [2023-11-24 22:06:15,398 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 172 flow. Second operand 4 states and 204 transitions. [2023-11-24 22:06:15,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 382 flow [2023-11-24 22:06:15,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-24 22:06:15,402 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 200 flow [2023-11-24 22:06:15,402 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2023-11-24 22:06:15,404 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2023-11-24 22:06:15,404 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 200 flow [2023-11-24 22:06:15,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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) [2023-11-24 22:06:15,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:15,405 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:15,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-24 22:06:15,406 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:15,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:15,406 INFO L85 PathProgramCache]: Analyzing trace with hash -96069121, now seen corresponding path program 1 times [2023-11-24 22:06:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992986246] [2023-11-24 22:06:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:15,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 22:06:15,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992986246] [2023-11-24 22:06:15,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992986246] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:06:15,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488014848] [2023-11-24 22:06:15,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:15,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:06:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:06:15,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:06:15,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-24 22:06:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:15,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-24 22:06:15,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:06:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 22:06:16,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:06:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488014848] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 22:06:16,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 22:06:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 7] total 13 [2023-11-24 22:06:16,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703246458] [2023-11-24 22:06:16,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 22:06:16,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-24 22:06:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-24 22:06:16,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-11-24 22:06:16,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 62 [2023-11-24 22:06:16,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 200 flow. Second operand has 14 states, 14 states have (on average 38.0) internal successors, (532), 14 states have internal predecessors, (532), 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) [2023-11-24 22:06:16,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:16,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 62 [2023-11-24 22:06:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:19,534 INFO L124 PetriNetUnfolderBase]: 10518/16031 cut-off events. [2023-11-24 22:06:19,534 INFO L125 PetriNetUnfolderBase]: For 14441/14442 co-relation queries the response was YES. [2023-11-24 22:06:19,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43530 conditions, 16031 events. 10518/16031 cut-off events. For 14441/14442 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 103124 event pairs, 669 based on Foata normal form. 1374/16338 useless extension candidates. Maximal degree in co-relation 43507. Up to 3663 conditions per place. [2023-11-24 22:06:19,814 INFO L140 encePairwiseOnDemand]: 52/62 looper letters, 173 selfloop transitions, 65 changer transitions 0/258 dead transitions. [2023-11-24 22:06:19,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 258 transitions, 1448 flow [2023-11-24 22:06:19,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 22:06:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-24 22:06:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 814 transitions. [2023-11-24 22:06:19,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7722960151802657 [2023-11-24 22:06:19,820 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 814 transitions. [2023-11-24 22:06:19,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 814 transitions. [2023-11-24 22:06:19,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:19,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 814 transitions. [2023-11-24 22:06:19,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 47.88235294117647) internal successors, (814), 17 states have internal predecessors, (814), 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) [2023-11-24 22:06:19,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 62.0) internal successors, (1116), 18 states have internal predecessors, (1116), 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) [2023-11-24 22:06:19,831 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 62.0) internal successors, (1116), 18 states have internal predecessors, (1116), 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) [2023-11-24 22:06:19,831 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 200 flow. Second operand 17 states and 814 transitions. [2023-11-24 22:06:19,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 258 transitions, 1448 flow [2023-11-24 22:06:19,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 258 transitions, 1425 flow, removed 7 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:19,847 INFO L231 Difference]: Finished difference. Result has 92 places, 114 transitions, 811 flow [2023-11-24 22:06:19,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=811, PETRI_PLACES=92, PETRI_TRANSITIONS=114} [2023-11-24 22:06:19,848 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 30 predicate places. [2023-11-24 22:06:19,849 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 114 transitions, 811 flow [2023-11-24 22:06:19,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 38.0) internal successors, (532), 14 states have internal predecessors, (532), 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) [2023-11-24 22:06:19,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:19,850 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:19,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-24 22:06:20,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-24 22:06:20,069 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:20,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2095000861, now seen corresponding path program 1 times [2023-11-24 22:06:20,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959442548] [2023-11-24 22:06:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:20,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:20,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-24 22:06:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:20,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959442548] [2023-11-24 22:06:20,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959442548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 22:06:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 22:06:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-24 22:06:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441017374] [2023-11-24 22:06:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 22:06:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-24 22:06:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-24 22:06:20,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-24 22:06:20,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 62 [2023-11-24 22:06:20,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 114 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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) [2023-11-24 22:06:20,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:20,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 62 [2023-11-24 22:06:20,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:22,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([376] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[][20], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 425#(= ~g1~0 1), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 50#L66true, 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 45#L88true, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 23#L48true, 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,366 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,366 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,367 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:06:22,367 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-24 22:06:22,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][24], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 8#L72true, Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 14#L94true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,583 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,759 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-11-24 22:06:22,759 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:06:22,759 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:06:22,759 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-24 22:06:22,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 30#L53-1true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,760 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,897 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][24], [189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 426#(and (= ~g1~0 1) (not (= (* 256 (div ~d1~0 256)) ~d1~0))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), 8#L72true, Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 14#L94true, 43#L50true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,898 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,898 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,898 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,934 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,935 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [30#L53-1true, 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,935 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 22:06:22,935 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,936 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,936 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,940 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-24 22:06:22,940 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,940 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,941 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-24 22:06:22,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:22,941 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 22:06:22,941 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,941 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:22,941 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,205 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 22:06:23,205 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,205 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,205 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,206 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 22:06:23,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,206 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,245 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-24 22:06:23,245 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,246 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,246 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-24 22:06:23,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 42#thread1EXITtrue, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,246 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 22:06:23,246 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,246 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,247 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,368 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-24 22:06:23,368 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,368 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,368 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-24 22:06:23,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,369 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-24 22:06:23,369 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,369 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,369 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][147], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 49#L87true, Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,579 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-24 22:06:23,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,580 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-11-24 22:06:23,580 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L72-->L75-1: Formula: (and (let ((.cse0 (= (mod v_~d2~0_51 256) 0)) (.cse2 (= v_~g2~0_43 v_~g2~0_42))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread2_#t~nondet4_32| 256) 0))) (or (and .cse1 .cse2) (and (= v_~g2~0_42 0) (not .cse1))))) (and .cse0 (= |v_thread2Thread1of1ForFork0_#t~nondet4_2| |v_thread2Thread1of1ForFork0_#t~nondet4_1|) .cse2))) (= v_~d2~0_51 (ite (= (ite (= (mod v_~d2~0_52 256) 0) 1 0) 0) 0 1))) InVars {~g2~0=v_~g2~0_43, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_1|, ~d2~0=v_~d2~0_52} OutVars{~g2~0=v_~g2~0_42, thread2Thread1of1ForFork0_#t~nondet4=|v_thread2Thread1of1ForFork0_#t~nondet4_2|, ~d2~0=v_~d2~0_51} AuxVars[|v_thread2_#t~nondet4_32|] AssignedVars[~g2~0, thread2Thread1of1ForFork0_#t~nondet4, ~d2~0][154], [406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 45#L88true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 120#(= ~g2~0 1), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:23,580 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-24 22:06:23,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 22:06:23,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 22:06:23,580 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-24 22:06:24,637 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,638 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-24 22:06:24,638 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 22:06:24,638 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 22:06:24,638 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-24 22:06:24,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,652 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-24 22:06:24,652 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,652 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,652 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,653 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-24 22:06:24,653 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,653 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,653 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,654 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2023-11-24 22:06:24,655 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,655 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,655 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-24 22:06:24,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,664 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-24 22:06:24,664 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,664 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,665 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,665 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-24 22:06:24,665 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,665 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,665 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,669 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-24 22:06:24,669 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,669 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,669 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [30#L53-1true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,671 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-24 22:06:24,671 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,671 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,671 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,672 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,672 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2023-11-24 22:06:24,672 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,672 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,672 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-24 22:06:24,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,676 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-24 22:06:24,676 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,676 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,677 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, 53#L75-1true, Black: 105#(= ~g1~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 43#L50true, Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,677 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-24 22:06:24,677 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,677 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,677 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 48#thread2EXITtrue, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,680 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-24 22:06:24,680 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,680 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,680 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, 48#thread2EXITtrue, Black: 299#(= (mod ~d2~0 256) 0), Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), 14#L94true, Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), 4#L121-4true, Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,681 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-24 22:06:24,681 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,681 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,681 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [42#thread1EXITtrue, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,684 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2023-11-24 22:06:24,684 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,684 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,684 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-24 22:06:24,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 7#L44true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,692 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-24 22:06:24,692 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,692 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,692 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([377] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][47], [79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 47#L122true, 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 292#(< 0 (mod ~d2~0 256)), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 95#(= ~pos~0 0), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 14#L94true, Black: 105#(= ~g1~0 1), 43#L50true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,692 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-24 22:06:24,693 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,693 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,693 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [32#L122-2true, 292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 53#L75-1true, 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,695 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2023-11-24 22:06:24,695 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,695 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,695 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-24 22:06:24,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 32#L122-2true, 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), 48#thread2EXITtrue, Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,698 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2023-11-24 22:06:24,698 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-24 22:06:24,698 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-24 22:06:24,699 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-24 22:06:24,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L94-->L97-1: Formula: (and (= (ite (= (ite (= (mod v_~d3~0_48 256) 0) 1 0) 0) 0 1) v_~d3~0_47) (let ((.cse0 (= (mod v_~d3~0_47 256) 0)) (.cse2 (= v_~g3~0_41 v_~g3~0_40))) (or (and (not .cse0) (let ((.cse1 (= (mod |v_thread3_#t~nondet5_34| 256) 0))) (or (and (= v_~g3~0_40 0) (not .cse1)) (and .cse1 .cse2)))) (and .cse0 (= |v_thread3Thread1of1ForFork2_#t~nondet5_2| |v_thread3Thread1of1ForFork2_#t~nondet5_1|) .cse2)))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_1|, ~g3~0=v_~g3~0_41, ~d3~0=v_~d3~0_48} OutVars{thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_2|, ~g3~0=v_~g3~0_40, ~d3~0=v_~d3~0_47} AuxVars[|v_thread3_#t~nondet5_34|] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~d3~0][141], [292#(< 0 (mod ~d2~0 256)), 79#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 91#(and (= |ULTIMATE.start_main_~#t3~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|))), 118#true, 87#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), Black: 406#(and (= (mod ~d2~0 256) 0) (<= 1 (mod ~g3~0 256))), Black: 170#(and (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), 423#true, Black: 189#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 299#(= (mod ~d2~0 256) 0), Black: 394#(and (= (mod ~d2~0 256) 0) (= ~d1~0 1) (= ~g3~0 1)), Black: 386#(and (not (= 0 (mod ~d3~0 256))) (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 396#(and (<= 1 (mod ~d2~0 256)) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), 75#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 400#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), Black: 95#(= ~pos~0 0), Black: 390#(and (= ~d1~0 1) (= ~g3~0 1) (not (= (mod ~d2~0 256) 0))), Black: 404#(and (= (mod ~d2~0 256) 0) (or (= (mod ~d1~0 256) 0) (< 0 (mod ~g3~0 256)))), Black: 398#(and (<= 1 (mod ~d2~0 256)) (<= 1 (mod ~g3~0 256))), 83#(and (= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), Black: 392#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~g3~0 1)), 37#L123-2true, Black: 402#(and (= (mod ~d2~0 256) 0) (= ~g3~0 1)), Black: 388#(and (= (mod ~d2~0 256) 0) (not (= (* (div ~d3~0 256) 256) ~d3~0)) (= ~d1~0 1) (= ~g3~0 1)), Black: 100#(= ~g2~0 1), 71#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 105#(= ~g1~0 1), Black: 110#(and (<= 1 ~g3~0) (<= (div ~g3~0 256) 0)), Black: 115#(= ~d3~0 1), 12#L97-1true, Black: 120#(= ~g2~0 1), Black: 121#(and (= ~g2~0 1) (not (= (* (div ~d2~0 256) 256) ~d2~0)))]) [2023-11-24 22:06:24,702 INFO L294 olderBase$Statistics]: this new event has 56 ancestors and is cut-off event [2023-11-24 22:06:24,702 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-24 22:06:24,702 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-24 22:06:24,702 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-24 22:06:24,702 INFO L124 PetriNetUnfolderBase]: 10908/17724 cut-off events. [2023-11-24 22:06:24,703 INFO L125 PetriNetUnfolderBase]: For 93286/95762 co-relation queries the response was YES. [2023-11-24 22:06:24,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74157 conditions, 17724 events. 10908/17724 cut-off events. For 93286/95762 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 128463 event pairs, 3163 based on Foata normal form. 614/16386 useless extension candidates. Maximal degree in co-relation 74118. Up to 5930 conditions per place. [2023-11-24 22:06:25,033 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 146 selfloop transitions, 15 changer transitions 0/195 dead transitions. [2023-11-24 22:06:25,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 195 transitions, 1805 flow [2023-11-24 22:06:25,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 22:06:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-24 22:06:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2023-11-24 22:06:25,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8225806451612904 [2023-11-24 22:06:25,035 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 204 transitions. [2023-11-24 22:06:25,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 204 transitions. [2023-11-24 22:06:25,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:25,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 204 transitions. [2023-11-24 22:06:25,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 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) [2023-11-24 22:06:25,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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) [2023-11-24 22:06:25,038 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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) [2023-11-24 22:06:25,038 INFO L175 Difference]: Start difference. First operand has 92 places, 114 transitions, 811 flow. Second operand 4 states and 204 transitions. [2023-11-24 22:06:25,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 195 transitions, 1805 flow [2023-11-24 22:06:25,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 195 transitions, 1762 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-24 22:06:25,118 INFO L231 Difference]: Finished difference. Result has 96 places, 117 transitions, 878 flow [2023-11-24 22:06:25,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=878, PETRI_PLACES=96, PETRI_TRANSITIONS=117} [2023-11-24 22:06:25,119 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 34 predicate places. [2023-11-24 22:06:25,119 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 117 transitions, 878 flow [2023-11-24 22:06:25,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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) [2023-11-24 22:06:25,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:25,120 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:25,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-24 22:06:25,120 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:25,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 215855855, now seen corresponding path program 1 times [2023-11-24 22:06:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685743502] [2023-11-24 22:06:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:25,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685743502] [2023-11-24 22:06:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685743502] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:06:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955122832] [2023-11-24 22:06:25,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:25,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:06:25,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:06:25,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:06:25,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 22:06:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:25,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 22:06:25,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:06:25,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:25,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:06:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 22:06:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955122832] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 22:06:25,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 22:06:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-11-24 22:06:25,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792683875] [2023-11-24 22:06:25,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 22:06:25,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 22:06:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 22:06:25,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-24 22:06:25,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:25,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 117 transitions, 878 flow. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:25,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:25,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:25,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-24 22:06:36,556 INFO L124 PetriNetUnfolderBase]: 36467/61034 cut-off events. [2023-11-24 22:06:36,556 INFO L125 PetriNetUnfolderBase]: For 305335/311070 co-relation queries the response was YES. [2023-11-24 22:06:37,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258557 conditions, 61034 events. 36467/61034 cut-off events. For 305335/311070 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 522838 event pairs, 6118 based on Foata normal form. 1233/60291 useless extension candidates. Maximal degree in co-relation 258515. Up to 17281 conditions per place. [2023-11-24 22:06:37,569 INFO L140 encePairwiseOnDemand]: 54/62 looper letters, 332 selfloop transitions, 28 changer transitions 1/394 dead transitions. [2023-11-24 22:06:37,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 394 transitions, 3822 flow [2023-11-24 22:06:37,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 22:06:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-24 22:06:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 329 transitions. [2023-11-24 22:06:37,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8844086021505376 [2023-11-24 22:06:37,572 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 329 transitions. [2023-11-24 22:06:37,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 329 transitions. [2023-11-24 22:06:37,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-24 22:06:37,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 329 transitions. [2023-11-24 22:06:37,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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) [2023-11-24 22:06:37,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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) [2023-11-24 22:06:37,577 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 62.0) internal successors, (434), 7 states have internal predecessors, (434), 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) [2023-11-24 22:06:37,577 INFO L175 Difference]: Start difference. First operand has 96 places, 117 transitions, 878 flow. Second operand 6 states and 329 transitions. [2023-11-24 22:06:37,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 394 transitions, 3822 flow [2023-11-24 22:06:37,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 394 transitions, 3812 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-11-24 22:06:37,880 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1055 flow [2023-11-24 22:06:37,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2023-11-24 22:06:37,881 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 40 predicate places. [2023-11-24 22:06:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1055 flow [2023-11-24 22:06:37,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 22:06:37,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-24 22:06:37,882 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-24 22:06:37,890 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 22:06:38,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:06:38,090 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 14 more)] === [2023-11-24 22:06:38,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 22:06:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash -403119027, now seen corresponding path program 2 times [2023-11-24 22:06:38,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 22:06:38,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141282300] [2023-11-24 22:06:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 22:06:38,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 22:06:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 22:06:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 22:06:38,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141282300] [2023-11-24 22:06:38,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141282300] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 22:06:38,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730289587] [2023-11-24 22:06:38,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 22:06:38,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 22:06:38,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 [2023-11-24 22:06:38,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 22:06:38,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34211400-4478-40b0-b884-019605156011/bin/uautomizer-verify-NlZe1sFDwI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-24 22:06:38,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 22:06:38,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 22:06:38,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 22:06:38,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 22:06:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:38,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 22:06:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 22:06:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730289587] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 22:06:38,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-24 22:06:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2023-11-24 22:06:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925298042] [2023-11-24 22:06:38,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-24 22:06:38,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 22:06:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 22:06:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 22:06:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-24 22:06:38,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 62 [2023-11-24 22:06:38,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1055 flow. Second operand has 7 states, 7 states have (on average 40.714285714285715) internal successors, (285), 7 states have internal predecessors, (285), 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) [2023-11-24 22:06:38,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-24 22:06:38,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 62 [2023-11-24 22:06:38,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand