./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd --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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:50:35,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:50:35,637 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 12:50:35,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:50:35,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:50:35,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:50:35,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:50:35,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:50:35,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:50:35,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:50:35,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:50:35,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:50:35,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:50:35,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:50:35,689 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:50:35,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:50:35,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:50:35,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:50:35,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:50:35,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 12:50:35,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:50:35,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:50:35,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:50:35,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:50:35,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:50:35,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:50:35,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:50:35,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:50:35,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:50:35,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:50:35,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:50:35,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:50:35,693 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-13 12:50:36,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:50:36,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:50:36,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:50:36,120 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:50:36,121 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:50:36,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c Unable to find full path for "g++" [2024-11-13 12:50:38,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:50:38,427 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:50:38,428 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-13 12:50:38,443 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/data/f84d391c1/c48ab62fa9d7494c856db7118bcda8b0/FLAGd3a116975 [2024-11-13 12:50:38,713 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/data/f84d391c1/c48ab62fa9d7494c856db7118bcda8b0 [2024-11-13 12:50:38,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:50:38,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:50:38,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:50:38,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:50:38,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:50:38,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:50:38" (1/1) ... [2024-11-13 12:50:38,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f79a4b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:38, skipping insertion in model container [2024-11-13 12:50:38,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:50:38" (1/1) ... [2024-11-13 12:50:38,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:50:38,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:50:39,014 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:50:39,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:50:39,062 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:50:39,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39 WrapperNode [2024-11-13 12:50:39,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:50:39,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:50:39,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:50:39,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:50:39,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,102 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-13 12:50:39,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:50:39,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:50:39,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:50:39,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:50:39,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 12:50:39,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,155 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:50:39,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:50:39,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:50:39,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:50:39,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (1/1) ... [2024-11-13 12:50:39,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:50:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:39,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:50:39,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:50:39,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:50:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 12:50:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 12:50:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 12:50:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 12:50:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 12:50:39,242 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 12:50:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:50:39,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:50:39,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:50:39,244 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:50:39,367 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:50:39,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:50:39,703 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:50:39,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:50:39,871 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:50:39,871 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 12:50:39,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:50:39 BoogieIcfgContainer [2024-11-13 12:50:39,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:50:39,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:50:39,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:50:39,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:50:39,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:50:38" (1/3) ... [2024-11-13 12:50:39,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b50a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:50:39, skipping insertion in model container [2024-11-13 12:50:39,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:50:39" (2/3) ... [2024-11-13 12:50:39,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b50a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:50:39, skipping insertion in model container [2024-11-13 12:50:39,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:50:39" (3/3) ... [2024-11-13 12:50:39,884 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-13 12:50:39,900 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:50:39,903 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-13 12:50:39,903 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:50:39,992 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 12:50:40,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2024-11-13 12:50:40,066 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-11-13 12:50:40,068 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 12:50:40,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 75 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-13 12:50:40,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2024-11-13 12:50:40,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2024-11-13 12:50:40,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:50:40,110 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@722f7774, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:50:40,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 12:50:40,135 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 12:50:40,135 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-11-13 12:50:40,135 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 12:50:40,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:40,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:50:40,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:40,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1268387076, now seen corresponding path program 1 times [2024-11-13 12:50:40,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399122589] [2024-11-13 12:50:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:40,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399122589] [2024-11-13 12:50:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399122589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:40,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:40,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:50:40,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200855020] [2024-11-13 12:50:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:50:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:50:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:50:40,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-13 12:50:40,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:40,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:40,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-13 12:50:40,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:41,330 INFO L124 PetriNetUnfolderBase]: 476/950 cut-off events. [2024-11-13 12:50:41,331 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-13 12:50:41,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 950 events. 476/950 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5519 event pairs, 58 based on Foata normal form. 66/912 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2024-11-13 12:50:41,346 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2024-11-13 12:50:41,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 266 flow [2024-11-13 12:50:41,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:50:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 12:50:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-13 12:50:41,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2024-11-13 12:50:41,363 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 5 states and 154 transitions. [2024-11-13 12:50:41,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 266 flow [2024-11-13 12:50:41,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 12:50:41,374 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 135 flow [2024-11-13 12:50:41,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2024-11-13 12:50:41,383 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-13 12:50:41,384 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 135 flow [2024-11-13 12:50:41,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:41,384 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:41,384 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:50:41,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:50:41,385 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:41,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1443123544, now seen corresponding path program 2 times [2024-11-13 12:50:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:41,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340734910] [2024-11-13 12:50:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:41,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:41,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:41,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340734910] [2024-11-13 12:50:41,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340734910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:41,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:41,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:50:41,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137924470] [2024-11-13 12:50:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:41,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:50:41,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:41,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:50:41,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:50:41,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-13 12:50:41,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:41,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:41,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-13 12:50:41,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:41,799 INFO L124 PetriNetUnfolderBase]: 632/1187 cut-off events. [2024-11-13 12:50:41,800 INFO L125 PetriNetUnfolderBase]: For 842/842 co-relation queries the response was YES. [2024-11-13 12:50:41,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1187 events. 632/1187 cut-off events. For 842/842 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6958 event pairs, 189 based on Foata normal form. 93/1144 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2024-11-13 12:50:41,812 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 26 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2024-11-13 12:50:41,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 224 flow [2024-11-13 12:50:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:50:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:50:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-13 12:50:41,814 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-11-13 12:50:41,814 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 135 flow. Second operand 3 states and 90 transitions. [2024-11-13 12:50:41,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 224 flow [2024-11-13 12:50:41,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 12:50:41,821 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 162 flow [2024-11-13 12:50:41,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-11-13 12:50:41,822 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-11-13 12:50:41,822 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 162 flow [2024-11-13 12:50:41,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:41,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:41,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:50:41,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:50:41,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:41,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:41,827 INFO L85 PathProgramCache]: Analyzing trace with hash -489963494, now seen corresponding path program 1 times [2024-11-13 12:50:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:41,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476657078] [2024-11-13 12:50:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:41,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476657078] [2024-11-13 12:50:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476657078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:50:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930102327] [2024-11-13 12:50:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:50:41,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:50:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:50:41,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-13 12:50:41,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:41,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:41,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-13 12:50:41,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:42,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,358 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,358 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,358 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,358 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,359 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,359 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,359 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,360 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 12:50:42,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,361 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,361 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,361 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,388 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,389 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,389 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,389 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,389 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,391 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,391 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,391 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,393 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,394 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,394 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,395 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,396 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,396 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,396 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,396 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,397 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,397 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,397 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,398 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,398 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,411 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,411 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,411 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,411 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,411 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 8#L56true, 42#L88-4true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,412 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,412 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,412 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,412 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 12:50:42,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,412 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,413 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,413 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,413 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,418 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,418 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,418 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,419 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,420 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,420 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,420 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,420 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,421 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,421 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,421 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,421 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,432 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,432 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,432 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,432 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,433 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,433 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 12:50:42,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,434 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,434 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,434 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,434 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,435 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,435 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,435 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,435 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,436 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,436 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,436 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,436 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,437 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,438 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,438 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,438 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,439 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,439 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,439 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,439 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,443 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][14], [Black: 61#true, 5#L89true, 9#L57true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-13 12:50:42,443 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,443 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,443 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,443 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][34], [Black: 61#true, 5#L89true, 9#L57true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-13 12:50:42,444 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,444 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,444 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,444 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,445 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 14#L69-1true, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L55-2true, 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,445 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,445 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,445 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,445 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,445 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,450 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [Black: 61#true, 42#L88-4true, 14#L69-1true, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,451 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,451 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,451 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,454 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,455 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,456 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([248] L55-2-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][17], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,456 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,456 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,456 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,456 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,456 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 12:50:42,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 28#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L55-2true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,457 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,457 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,457 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,457 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 15#thread3EXITtrue, 16#L43-2true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,458 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,458 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,459 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,459 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,461 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [5#L89true, Black: 61#true, 16#L43-2true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,461 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,462 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,462 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,462 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,462 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,463 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][45], [5#L89true, Black: 61#true, 14#L69-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L46-2true, 11#L55-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,463 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,463 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,463 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,463 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,464 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:42,466 INFO L124 PetriNetUnfolderBase]: 1351/2331 cut-off events. [2024-11-13 12:50:42,466 INFO L125 PetriNetUnfolderBase]: For 1765/1821 co-relation queries the response was YES. [2024-11-13 12:50:42,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 2331 events. 1351/2331 cut-off events. For 1765/1821 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14314 event pairs, 441 based on Foata normal form. 11/1861 useless extension candidates. Maximal degree in co-relation 3065. Up to 905 conditions per place. [2024-11-13 12:50:42,498 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 34 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-13 12:50:42,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 292 flow [2024-11-13 12:50:42,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:50:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:50:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-13 12:50:42,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-13 12:50:42,502 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 162 flow. Second operand 3 states and 97 transitions. [2024-11-13 12:50:42,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 292 flow [2024-11-13 12:50:42,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:50:42,517 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 174 flow [2024-11-13 12:50:42,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-11-13 12:50:42,519 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-13 12:50:42,520 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 174 flow [2024-11-13 12:50:42,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:42,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:42,521 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:50:42,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:50:42,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:42,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1947758569, now seen corresponding path program 1 times [2024-11-13 12:50:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:42,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137162064] [2024-11-13 12:50:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137162064] [2024-11-13 12:50:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137162064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:42,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:42,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:50:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565944109] [2024-11-13 12:50:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:50:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:50:42,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:50:42,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-13 12:50:42,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:42,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:42,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-13 12:50:42,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:42,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 3#L88-3true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,950 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:42,950 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,950 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,951 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:42,971 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, 22#$Ultimate##0true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,971 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-13 12:50:42,971 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,971 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:42,971 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 5#L89true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 22#$Ultimate##0true, 66#true, Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:42,997 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-13 12:50:42,997 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-13 12:50:42,997 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:42,998 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:43,052 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, Black: 68#(<= 1 (mod ~d2~0 256)), 14#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:43,052 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-13 12:50:43,053 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:43,053 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-13 12:50:43,053 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:43,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [Black: 61#true, 30#L42true, 42#L88-4true, 8#L56true, 15#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:43,054 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-13 12:50:43,054 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:43,054 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-13 12:50:43,054 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-13 12:50:43,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([238] L41-2-->L42: Formula: (not (= (mod v_~v_assert~0_2 256) 0)) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2} AuxVars[] AssignedVars[][8], [5#L89true, Black: 61#true, 30#L42true, 8#L56true, 15#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-13 12:50:43,058 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-13 12:50:43,058 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-13 12:50:43,058 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-13 12:50:43,058 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-13 12:50:43,066 INFO L124 PetriNetUnfolderBase]: 1020/2054 cut-off events. [2024-11-13 12:50:43,066 INFO L125 PetriNetUnfolderBase]: For 1109/1189 co-relation queries the response was YES. [2024-11-13 12:50:43,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 2054 events. 1020/2054 cut-off events. For 1109/1189 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 13660 event pairs, 400 based on Foata normal form. 9/1836 useless extension candidates. Maximal degree in co-relation 2488. Up to 751 conditions per place. [2024-11-13 12:50:43,085 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 32 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-13 12:50:43,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 287 flow [2024-11-13 12:50:43,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:50:43,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 12:50:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-13 12:50:43,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-13 12:50:43,089 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 174 flow. Second operand 3 states and 97 transitions. [2024-11-13 12:50:43,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 287 flow [2024-11-13 12:50:43,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:50:43,098 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 190 flow [2024-11-13 12:50:43,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-13 12:50:43,101 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-13 12:50:43,101 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 190 flow [2024-11-13 12:50:43,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:43,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:43,102 INFO L204 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] [2024-11-13 12:50:43,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:50:43,102 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:43,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1424165410, now seen corresponding path program 1 times [2024-11-13 12:50:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:43,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147769682] [2024-11-13 12:50:43,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:43,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:43,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147769682] [2024-11-13 12:50:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147769682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:43,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334788705] [2024-11-13 12:50:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:43,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:43,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:43,415 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:43,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 12:50:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:43,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:50:43,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:43,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334788705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:50:43,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:50:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 5] total 9 [2024-11-13 12:50:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992167891] [2024-11-13 12:50:43,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 12:50:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 12:50:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:50:43,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-11-13 12:50:43,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 190 flow. Second operand has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:43,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:43,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-11-13 12:50:43,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:44,974 INFO L124 PetriNetUnfolderBase]: 3578/6342 cut-off events. [2024-11-13 12:50:44,975 INFO L125 PetriNetUnfolderBase]: For 4983/4983 co-relation queries the response was YES. [2024-11-13 12:50:44,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16551 conditions, 6342 events. 3578/6342 cut-off events. For 4983/4983 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 44482 event pairs, 253 based on Foata normal form. 148/6189 useless extension candidates. Maximal degree in co-relation 11346. Up to 1177 conditions per place. [2024-11-13 12:50:45,013 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 56 selfloop transitions, 16 changer transitions 53/140 dead transitions. [2024-11-13 12:50:45,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 140 transitions, 784 flow [2024-11-13 12:50:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 12:50:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-13 12:50:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 300 transitions. [2024-11-13 12:50:45,016 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2024-11-13 12:50:45,016 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 190 flow. Second operand 12 states and 300 transitions. [2024-11-13 12:50:45,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 140 transitions, 784 flow [2024-11-13 12:50:45,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 140 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 12:50:45,027 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 288 flow [2024-11-13 12:50:45,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2024-11-13 12:50:45,028 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-11-13 12:50:45,029 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 288 flow [2024-11-13 12:50:45,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.444444444444443) internal successors, (184), 9 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:45,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:45,029 INFO L204 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] [2024-11-13 12:50:45,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 12:50:45,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:45,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:45,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1328353343, now seen corresponding path program 1 times [2024-11-13 12:50:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292693615] [2024-11-13 12:50:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:45,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:45,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292693615] [2024-11-13 12:50:45,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292693615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:45,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024021368] [2024-11-13 12:50:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:45,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:45,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:45,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:45,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 12:50:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:45,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:50:45,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:45,700 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:45,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024021368] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:50:45,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:50:45,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 8 [2024-11-13 12:50:45,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590820754] [2024-11-13 12:50:45,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:45,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 12:50:45,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 12:50:45,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:50:45,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-13 12:50:45,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:45,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:45,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-13 12:50:45,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:46,566 INFO L124 PetriNetUnfolderBase]: 2314/4350 cut-off events. [2024-11-13 12:50:46,567 INFO L125 PetriNetUnfolderBase]: For 16868/16940 co-relation queries the response was YES. [2024-11-13 12:50:46,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15444 conditions, 4350 events. 2314/4350 cut-off events. For 16868/16940 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 30095 event pairs, 151 based on Foata normal form. 170/4237 useless extension candidates. Maximal degree in co-relation 13038. Up to 1195 conditions per place. [2024-11-13 12:50:46,614 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 24 changer transitions 33/129 dead transitions. [2024-11-13 12:50:46,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 129 transitions, 999 flow [2024-11-13 12:50:46,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:50:46,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-13 12:50:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 266 transitions. [2024-11-13 12:50:46,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186046511627907 [2024-11-13 12:50:46,620 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 288 flow. Second operand 10 states and 266 transitions. [2024-11-13 12:50:46,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 129 transitions, 999 flow [2024-11-13 12:50:46,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 908 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-11-13 12:50:46,651 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 487 flow [2024-11-13 12:50:46,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=487, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-11-13 12:50:46,652 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-13 12:50:46,652 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 487 flow [2024-11-13 12:50:46,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.375) internal successors, (171), 8 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:46,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:46,653 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-11-13 12:50:46,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 12:50:46,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:46,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:46,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:46,854 INFO L85 PathProgramCache]: Analyzing trace with hash -245188896, now seen corresponding path program 2 times [2024-11-13 12:50:46,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:46,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964732273] [2024-11-13 12:50:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:50:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:47,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964732273] [2024-11-13 12:50:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964732273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:47,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:50:47,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688425255] [2024-11-13 12:50:47,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:47,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:50:47,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:47,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:50:47,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:50:47,064 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-13 12:50:47,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:47,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:47,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-13 12:50:47,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:47,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([239] L41-2-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_~v_assert~0_29 256) 0)) InVars {~v_assert~0=v_~v_assert~0_29} OutVars{~v_assert~0=v_~v_assert~0_29, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset][61], [Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 63#(<= 1 (mod ~v_assert~0 256)), 18#thread1EXITtrue, Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 290#true, 5#L89true, 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 90#(or (= ~d1~0 1) (= ~d1~0 0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 505#true, Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,594 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-13 12:50:47,594 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-13 12:50:47,594 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-13 12:50:47,594 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-13 12:50:47,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,669 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,669 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,669 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,669 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 14#L69-1true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,670 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,670 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,670 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,670 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,689 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 14#L69-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,690 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,690 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,691 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,691 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,691 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,691 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,691 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,692 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,693 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 14#L69-1true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,693 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,694 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,694 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,694 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,694 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,695 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,695 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,695 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,695 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, 16#L43-2true, Black: 71#true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,696 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-13 12:50:47,696 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,696 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,696 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-13 12:50:47,714 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][58], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, 15#thread3EXITtrue, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 28#L46-2true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,715 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,715 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,715 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,715 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,715 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,715 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, Black: 71#true, 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#thread3EXITtrue, Black: 368#(= ~v_assert~0 1), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, Black: 499#(and (<= 1 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 54#(<= 0 ~pos~0), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256)))]) [2024-11-13 12:50:47,716 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,716 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,716 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,716 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-13 12:50:47,716 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-13 12:50:47,735 INFO L124 PetriNetUnfolderBase]: 2178/3841 cut-off events. [2024-11-13 12:50:47,735 INFO L125 PetriNetUnfolderBase]: For 28929/30665 co-relation queries the response was YES. [2024-11-13 12:50:47,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16239 conditions, 3841 events. 2178/3841 cut-off events. For 28929/30665 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 25223 event pairs, 663 based on Foata normal form. 113/3138 useless extension candidates. Maximal degree in co-relation 12766. Up to 1378 conditions per place. [2024-11-13 12:50:47,789 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 62 selfloop transitions, 5 changer transitions 0/100 dead transitions. [2024-11-13 12:50:47,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 884 flow [2024-11-13 12:50:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:50:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:50:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-13 12:50:47,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2024-11-13 12:50:47,791 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 487 flow. Second operand 4 states and 132 transitions. [2024-11-13 12:50:47,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 884 flow [2024-11-13 12:50:47,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 777 flow, removed 48 selfloop flow, removed 6 redundant places. [2024-11-13 12:50:47,820 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 462 flow [2024-11-13 12:50:47,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2024-11-13 12:50:47,822 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-11-13 12:50:47,822 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 462 flow [2024-11-13 12:50:47,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:47,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:47,822 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-11-13 12:50:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:50:47,823 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash -968598070, now seen corresponding path program 2 times [2024-11-13 12:50:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:47,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426592038] [2024-11-13 12:50:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:47,999 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:50:47,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:47,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426592038] [2024-11-13 12:50:47,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426592038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:50:47,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:50:47,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:50:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346190349] [2024-11-13 12:50:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:50:48,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:50:48,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:50:48,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:50:48,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-13 12:50:48,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:48,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:48,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-13 12:50:48,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:48,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), 42#L88-4true, Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 54#(<= 0 ~pos~0), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 505#true, 512#true, 22#$Ultimate##0true, Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-13 12:50:48,122 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-13 12:50:48,122 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 12:50:48,122 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 12:50:48,122 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-11-13 12:50:48,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 54#(<= 0 ~pos~0), 5#L89true, 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 505#true, Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-13 12:50:48,128 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 12:50:48,128 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 12:50:48,128 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 12:50:48,128 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-13 12:50:48,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 42#L88-4true, Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 505#true, Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 507#(= (mod ~d2~0 256) 0)]) [2024-11-13 12:50:48,192 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-13 12:50:48,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:48,193 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-13 12:50:48,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-13 12:50:48,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([242] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 66#true, 16#L43-2true, 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 71#true, 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 512#true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 505#true, Black: 507#(= (mod ~d2~0 256) 0)]) [2024-11-13 12:50:48,204 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-13 12:50:48,204 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:48,204 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-13 12:50:48,204 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-13 12:50:48,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([243] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][54], [Black: 61#true, 278#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 270#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), 514#(= (mod ~d1~0 256) 0), 5#L89true, 417#(< 0 (mod ~v_assert~0 256)), 25#L60-1true, Black: 497#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 493#(and (<= 1 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 495#(and (<= 1 (mod ~v_assert~0 256)) (<= 0 ~pos~0)), 507#(= (mod ~d2~0 256) 0), 28#L46-2true, 22#$Ultimate##0true, Black: 54#(<= 0 ~pos~0), Black: 268#(and (= ~pos~0 0) (or (= ~d1~0 1) (= ~d1~0 0)) (<= 1 (mod ~v_assert~0 256))), Black: 276#(and (or (= ~d1~0 1) (= ~d1~0 0)) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 505#true, Black: 274#(and (or (= ~d1~0 1) (= ~d1~0 0)) (<= 2 ~pos~0) (<= 1 (mod ~v_assert~0 256))), Black: 508#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0))]) [2024-11-13 12:50:48,357 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-13 12:50:48,358 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:48,358 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:48,358 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-13 12:50:48,447 INFO L124 PetriNetUnfolderBase]: 1045/2438 cut-off events. [2024-11-13 12:50:48,447 INFO L125 PetriNetUnfolderBase]: For 6942/7380 co-relation queries the response was YES. [2024-11-13 12:50:48,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8540 conditions, 2438 events. 1045/2438 cut-off events. For 6942/7380 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17276 event pairs, 340 based on Foata normal form. 72/2314 useless extension candidates. Maximal degree in co-relation 4107. Up to 532 conditions per place. [2024-11-13 12:50:48,474 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 46 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2024-11-13 12:50:48,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 620 flow [2024-11-13 12:50:48,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:50:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 12:50:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-13 12:50:48,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7383720930232558 [2024-11-13 12:50:48,476 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 462 flow. Second operand 4 states and 127 transitions. [2024-11-13 12:50:48,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 620 flow [2024-11-13 12:50:48,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 12:50:48,488 INFO L231 Difference]: Finished difference. Result has 72 places, 68 transitions, 483 flow [2024-11-13 12:50:48,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=72, PETRI_TRANSITIONS=68} [2024-11-13 12:50:48,489 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2024-11-13 12:50:48,489 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 483 flow [2024-11-13 12:50:48,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:48,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:48,490 INFO L204 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] [2024-11-13 12:50:48,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:50:48,490 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:48,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:48,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1204498869, now seen corresponding path program 1 times [2024-11-13 12:50:48,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:48,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465401550] [2024-11-13 12:50:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:48,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465401550] [2024-11-13 12:50:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465401550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998581013] [2024-11-13 12:50:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:48,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:48,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:48,768 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:48,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 12:50:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:48,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 12:50:48,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:49,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998581013] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:50:49,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:50:49,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-13 12:50:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632357835] [2024-11-13 12:50:49,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:49,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 12:50:49,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:49,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 12:50:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:50:49,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-13 12:50:49,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 483 flow. Second operand has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:49,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:49,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-13 12:50:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:50,987 INFO L124 PetriNetUnfolderBase]: 5799/10379 cut-off events. [2024-11-13 12:50:50,987 INFO L125 PetriNetUnfolderBase]: For 45065/45145 co-relation queries the response was YES. [2024-11-13 12:50:51,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42449 conditions, 10379 events. 5799/10379 cut-off events. For 45065/45145 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 74004 event pairs, 581 based on Foata normal form. 236/10525 useless extension candidates. Maximal degree in co-relation 18600. Up to 2126 conditions per place. [2024-11-13 12:50:51,185 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 93 selfloop transitions, 55 changer transitions 68/230 dead transitions. [2024-11-13 12:50:51,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 230 transitions, 2135 flow [2024-11-13 12:50:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 12:50:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-13 12:50:51,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 384 transitions. [2024-11-13 12:50:51,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-13 12:50:51,187 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 483 flow. Second operand 16 states and 384 transitions. [2024-11-13 12:50:51,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 230 transitions, 2135 flow [2024-11-13 12:50:51,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 230 transitions, 2135 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 12:50:51,213 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 1151 flow [2024-11-13 12:50:51,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1151, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2024-11-13 12:50:51,215 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-11-13 12:50:51,216 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 1151 flow [2024-11-13 12:50:51,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.0) internal successors, (216), 12 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:51,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 12:50:51,216 INFO L204 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] [2024-11-13 12:50:51,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 12:50:51,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:51,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 12:50:51,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:50:51,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1922516229, now seen corresponding path program 2 times [2024-11-13 12:50:51,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:50:51,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773462450] [2024-11-13 12:50:51,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:50:51,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:50:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:50:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:50:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773462450] [2024-11-13 12:50:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773462450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:50:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057820213] [2024-11-13 12:50:51,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:50:51,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:50:51,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:50:51,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:50:51,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 12:50:51,710 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:50:51,711 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:50:51,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:50:51,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:50:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:51,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:50:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:50:52,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057820213] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:50:52,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:50:52,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 13 [2024-11-13 12:50:52,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447028474] [2024-11-13 12:50:52,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:50:52,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 12:50:52,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:50:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 12:50:52,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-13 12:50:52,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-11-13 12:50:52,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 1151 flow. Second operand has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:52,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 12:50:52,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-11-13 12:50:52,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 12:50:54,448 INFO L124 PetriNetUnfolderBase]: 7510/12740 cut-off events. [2024-11-13 12:50:54,448 INFO L125 PetriNetUnfolderBase]: For 86359/86471 co-relation queries the response was YES. [2024-11-13 12:50:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57716 conditions, 12740 events. 7510/12740 cut-off events. For 86359/86471 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 86569 event pairs, 633 based on Foata normal form. 260/12978 useless extension candidates. Maximal degree in co-relation 57687. Up to 4702 conditions per place. [2024-11-13 12:50:54,516 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2024-11-13 12:50:54,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 236 transitions, 2877 flow [2024-11-13 12:50:54,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 12:50:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-13 12:50:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 289 transitions. [2024-11-13 12:50:54,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.516994633273703 [2024-11-13 12:50:54,519 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 1151 flow. Second operand 13 states and 289 transitions. [2024-11-13 12:50:54,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 236 transitions, 2877 flow [2024-11-13 12:50:54,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 236 transitions, 2452 flow, removed 201 selfloop flow, removed 10 redundant places. [2024-11-13 12:50:54,856 INFO L231 Difference]: Finished difference. Result has 86 places, 0 transitions, 0 flow [2024-11-13 12:50:54,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=86, PETRI_TRANSITIONS=0} [2024-11-13 12:50:54,857 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2024-11-13 12:50:54,857 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 0 transitions, 0 flow [2024-11-13 12:50:54,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.615384615384617) internal successors, (229), 13 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:50:54,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-13 12:50:54,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-13 12:50:54,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-13 12:50:54,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-13 12:50:54,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-13 12:50:54,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 12:50:55,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 12:50:55,065 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-13 12:50:55,069 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 12:50:55,069 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:50:55,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:50:55 BasicIcfg [2024-11-13 12:50:55,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:50:55,077 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:50:55,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:50:55,077 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:50:55,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:50:39" (3/4) ... [2024-11-13 12:50:55,080 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 12:50:55,083 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-13 12:50:55,083 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-13 12:50:55,083 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-13 12:50:55,088 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2024-11-13 12:50:55,088 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-13 12:50:55,089 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-13 12:50:55,089 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 12:50:55,177 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:50:55,178 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 12:50:55,178 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:50:55,181 INFO L158 Benchmark]: Toolchain (without parser) took 16461.24ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 94.0MB in the beginning and 449.6MB in the end (delta: -355.6MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2024-11-13 12:50:55,181 INFO L158 Benchmark]: CDTParser took 1.49ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:50:55,182 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.16ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 82.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:50:55,182 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.75ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:50:55,183 INFO L158 Benchmark]: Boogie Preprocessor took 64.47ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:50:55,183 INFO L158 Benchmark]: RCFGBuilder took 699.15ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 59.4MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 12:50:55,183 INFO L158 Benchmark]: TraceAbstraction took 15202.05ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 58.7MB in the beginning and 453.1MB in the end (delta: -394.3MB). Peak memory consumption was 384.6MB. Max. memory is 16.1GB. [2024-11-13 12:50:55,184 INFO L158 Benchmark]: Witness Printer took 101.40ms. Allocated memory is still 671.1MB. Free memory was 453.1MB in the beginning and 449.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:50:55,187 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49ms. Allocated memory is still 167.8MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.16ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 82.3MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.75ms. Allocated memory is still 117.4MB. Free memory was 82.3MB in the beginning and 81.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.47ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 699.15ms. Allocated memory is still 117.4MB. Free memory was 79.5MB in the beginning and 59.4MB in the end (delta: 20.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15202.05ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 58.7MB in the beginning and 453.1MB in the end (delta: -394.3MB). Peak memory consumption was 384.6MB. Max. memory is 16.1GB. * Witness Printer took 101.40ms. Allocated memory is still 671.1MB. Free memory was 453.1MB in the beginning and 449.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 74]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.0s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 650 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 615 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1766 IncrementalHoareTripleChecker+Invalid, 1854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 25 mSDtfsCounter, 1766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 281 SyntacticMatches, 16 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 1600 SizeOfPredicates, 22 NumberOfNonLiveVariables, 652 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 76/119 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-13 12:50:55,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3f06c4ba-f11d-4585-a612-a24d5a5e1ca1/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE