./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:01:44,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:01:44,904 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:01:44,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:01:44,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:01:44,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:01:44,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:01:44,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:01:44,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:01:44,951 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:01:44,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:01:44,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:01:44,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:01:44,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:01:44,954 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:01:44,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:01:44,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:01:44,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:01:44,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:01:44,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:01:44,958 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:01:44,958 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:01:44,959 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:01:44,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:01:44,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:01:44,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:01:44,960 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:01:44,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:01:44,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:01:44,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:01:44,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:01:44,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:01:44,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:01:44,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:44,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:01:44,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:01:44,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:01:44,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:01:44,978 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:01:44,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:01:44,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:01:44,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:01:44,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ac00c9540bbc99a446c9cb6c02e180c3a0ad4fef3c182d14bafdc7ea871c54c [2024-10-31 22:01:45,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:01:45,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:01:45,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:01:45,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:01:45,348 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:01:45,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c Unable to find full path for "g++" [2024-10-31 22:01:47,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:01:47,697 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:01:47,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/sv-benchmarks/c/weaver/parallel-misc-3-extended.wvr.c [2024-10-31 22:01:47,715 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/data/947a29806/0af368c1edce4a39905eee6430129f03/FLAG4faea3387 [2024-10-31 22:01:48,059 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/data/947a29806/0af368c1edce4a39905eee6430129f03 [2024-10-31 22:01:48,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:01:48,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:01:48,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:48,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:01:48,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:01:48,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1baa72eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48, skipping insertion in model container [2024-10-31 22:01:48,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:01:48,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:48,517 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:01:48,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:01:48,577 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:01:48,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48 WrapperNode [2024-10-31 22:01:48,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:01:48,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:48,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:01:48,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:01:48,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,652 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-10-31 22:01:48,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:01:48,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:01:48,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:01:48,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:01:48,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,704 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-10-31 22:01:48,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:01:48,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:01:48,731 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:01:48,731 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:01:48,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (1/1) ... [2024-10-31 22:01:48,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:01:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:48,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:01:48,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:01:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:01:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:01:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:01:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:01:48,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:01:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 22:01:48,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 22:01:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:01:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:01:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:01:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:01:48,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:01:48,818 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:01:48,998 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:01:49,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:01:49,317 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:01:49,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:01:49,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:01:49,504 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 22:01:49,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:49 BoogieIcfgContainer [2024-10-31 22:01:49,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:01:49,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:01:49,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:01:49,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:01:49,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:01:48" (1/3) ... [2024-10-31 22:01:49,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:49, skipping insertion in model container [2024-10-31 22:01:49,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:01:48" (2/3) ... [2024-10-31 22:01:49,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@934069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:01:49, skipping insertion in model container [2024-10-31 22:01:49,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:01:49" (3/3) ... [2024-10-31 22:01:49,515 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2024-10-31 22:01:49,534 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:01:49,534 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:01:49,535 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:01:49,627 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-31 22:01:49,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 105 flow [2024-10-31 22:01:49,705 INFO L124 PetriNetUnfolderBase]: 6/39 cut-off events. [2024-10-31 22:01:49,706 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:01:49,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 6/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-10-31 22:01:49,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 42 transitions, 105 flow [2024-10-31 22:01:49,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 38 transitions, 94 flow [2024-10-31 22:01:49,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:01:49,729 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;@578b2d3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:01:49,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-31 22:01:49,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:01:49,744 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-10-31 22:01:49,744 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-31 22:01:49,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:49,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:49,746 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-10-31 22:01:49,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1510711196, now seen corresponding path program 1 times [2024-10-31 22:01:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:49,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678155856] [2024-10-31 22:01:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678155856] [2024-10-31 22:01:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678155856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:50,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:50,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:50,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055678087] [2024-10-31 22:01:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:50,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:50,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:50,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-31 22:01:50,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-31 22:01:50,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:50,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-31 22:01:50,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:50,474 INFO L124 PetriNetUnfolderBase]: 872/1394 cut-off events. [2024-10-31 22:01:50,474 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-31 22:01:50,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 1394 events. 872/1394 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6639 event pairs, 86 based on Foata normal form. 2/1237 useless extension candidates. Maximal degree in co-relation 2294. Up to 1025 conditions per place. [2024-10-31 22:01:50,490 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 32 selfloop transitions, 7 changer transitions 1/53 dead transitions. [2024-10-31 22:01:50,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 219 flow [2024-10-31 22:01:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:01:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-31 22:01:50,504 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-31 22:01:50,506 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 94 flow. Second operand 3 states and 93 transitions. [2024-10-31 22:01:50,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 219 flow [2024-10-31 22:01:50,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 53 transitions, 197 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-31 22:01:50,514 INFO L231 Difference]: Finished difference. Result has 37 places, 42 transitions, 125 flow [2024-10-31 22:01:50,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=42} [2024-10-31 22:01:50,520 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -5 predicate places. [2024-10-31 22:01:50,521 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 42 transitions, 125 flow [2024-10-31 22:01:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-10-31 22:01:50,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:50,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] [2024-10-31 22:01:50,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:01:50,522 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-10-31 22:01:50,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -679368378, now seen corresponding path program 1 times [2024-10-31 22:01:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:50,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800622889] [2024-10-31 22:01:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:50,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:50,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:50,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800622889] [2024-10-31 22:01:50,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800622889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:50,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:50,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633931877] [2024-10-31 22:01:50,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:50,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:50,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:50,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:50,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-31 22:01:50,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 42 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-10-31 22:01:50,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:50,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-31 22:01:50,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:50,920 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][28], [25#thread3EXITtrue, 8#L72true, Black: 51#(= ~pos~0 0), 49#true, 6#L121-4true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-31 22:01:50,922 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,922 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-31 22:01:50,922 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,922 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][27], [25#thread3EXITtrue, 8#L72true, Black: 51#(= ~pos~0 0), 49#true, 6#L121-4true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-31 22:01:50,923 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,924 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,924 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-10-31 22:01:50,924 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-10-31 22:01:50,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([335] L44-->L50: Formula: (= (+ v_~pos~0_28 1) v_~pos~0_27) InVars {~pos~0=v_~pos~0_28} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_27} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][28], [25#thread3EXITtrue, 8#L72true, 18#L122true, Black: 51#(= ~pos~0 0), 49#true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-31 22:01:50,939 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 22:01:50,939 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 22:01:50,940 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 22:01:50,940 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 22:01:50,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][27], [25#thread3EXITtrue, 8#L72true, 18#L122true, Black: 51#(= ~pos~0 0), 49#true, 13#L50true, 55#(= ~g2~0 1)]) [2024-10-31 22:01:50,941 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-31 22:01:50,941 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 22:01:50,941 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-31 22:01:50,942 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-31 22:01:51,028 INFO L124 PetriNetUnfolderBase]: 698/1163 cut-off events. [2024-10-31 22:01:51,028 INFO L125 PetriNetUnfolderBase]: For 244/346 co-relation queries the response was YES. [2024-10-31 22:01:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 1163 events. 698/1163 cut-off events. For 244/346 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5670 event pairs, 79 based on Foata normal form. 45/1028 useless extension candidates. Maximal degree in co-relation 1075. Up to 466 conditions per place. [2024-10-31 22:01:51,061 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-31 22:01:51,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 217 flow [2024-10-31 22:01:51,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:01:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-10-31 22:01:51,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2024-10-31 22:01:51,067 INFO L175 Difference]: Start difference. First operand has 37 places, 42 transitions, 125 flow. Second operand 3 states and 94 transitions. [2024-10-31 22:01:51,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 217 flow [2024-10-31 22:01:51,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 53 transitions, 208 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-31 22:01:51,072 INFO L231 Difference]: Finished difference. Result has 39 places, 43 transitions, 128 flow [2024-10-31 22:01:51,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=43} [2024-10-31 22:01:51,073 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-10-31 22:01:51,073 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 43 transitions, 128 flow [2024-10-31 22:01:51,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-10-31 22:01:51,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:51,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:01:51,080 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-10-31 22:01:51,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,081 INFO L85 PathProgramCache]: Analyzing trace with hash 418230308, now seen corresponding path program 1 times [2024-10-31 22:01:51,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586467006] [2024-10-31 22:01:51,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:51,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586467006] [2024-10-31 22:01:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586467006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:51,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907375255] [2024-10-31 22:01:51,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:51,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-31 22:01:51,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 43 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-31 22:01:51,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:51,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-31 22:01:51,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:51,514 INFO L124 PetriNetUnfolderBase]: 801/1278 cut-off events. [2024-10-31 22:01:51,514 INFO L125 PetriNetUnfolderBase]: For 480/702 co-relation queries the response was YES. [2024-10-31 22:01:51,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1278 events. 801/1278 cut-off events. For 480/702 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6205 event pairs, 101 based on Foata normal form. 46/1093 useless extension candidates. Maximal degree in co-relation 955. Up to 631 conditions per place. [2024-10-31 22:01:51,528 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-31 22:01:51,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 237 flow [2024-10-31 22:01:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:01:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-10-31 22:01:51,530 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2024-10-31 22:01:51,530 INFO L175 Difference]: Start difference. First operand has 39 places, 43 transitions, 128 flow. Second operand 3 states and 95 transitions. [2024-10-31 22:01:51,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 237 flow [2024-10-31 22:01:51,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:01:51,535 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 138 flow [2024-10-31 22:01:51,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2024-10-31 22:01:51,537 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2024-10-31 22:01:51,538 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 138 flow [2024-10-31 22:01:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-10-31 22:01:51,538 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:51,538 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] [2024-10-31 22:01:51,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:01:51,539 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-10-31 22:01:51,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1654943644, now seen corresponding path program 1 times [2024-10-31 22:01:51,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615649699] [2024-10-31 22:01:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:51,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:01:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:51,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615649699] [2024-10-31 22:01:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615649699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:51,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:01:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088311169] [2024-10-31 22:01:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:51,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:01:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:01:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:01:51,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-10-31 22:01:51,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 138 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-10-31 22:01:51,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:51,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-10-31 22:01:51,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:51,960 INFO L124 PetriNetUnfolderBase]: 912/1477 cut-off events. [2024-10-31 22:01:51,960 INFO L125 PetriNetUnfolderBase]: For 618/830 co-relation queries the response was YES. [2024-10-31 22:01:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 1477 events. 912/1477 cut-off events. For 618/830 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7305 event pairs, 182 based on Foata normal form. 48/1246 useless extension candidates. Maximal degree in co-relation 1141. Up to 561 conditions per place. [2024-10-31 22:01:51,977 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 33 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-10-31 22:01:51,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 251 flow [2024-10-31 22:01:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:01:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:01:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-31 22:01:51,980 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-31 22:01:51,981 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 138 flow. Second operand 3 states and 93 transitions. [2024-10-31 22:01:51,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 251 flow [2024-10-31 22:01:51,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:01:51,986 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 148 flow [2024-10-31 22:01:51,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2024-10-31 22:01:51,988 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-10-31 22:01:51,989 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 148 flow [2024-10-31 22:01:51,989 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-10-31 22:01:51,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:51,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:01:51,990 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-10-31 22:01:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash 18421174, now seen corresponding path program 1 times [2024-10-31 22:01:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624549950] [2024-10-31 22:01:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:01:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:52,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624549950] [2024-10-31 22:01:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624549950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:52,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:52,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:52,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367502839] [2024-10-31 22:01:52,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:52,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:52,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:52,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:52,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:52,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2024-10-31 22:01:52,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-31 22:01:52,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:52,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2024-10-31 22:01:52,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:52,926 INFO L124 PetriNetUnfolderBase]: 2153/3269 cut-off events. [2024-10-31 22:01:52,926 INFO L125 PetriNetUnfolderBase]: For 1697/1813 co-relation queries the response was YES. [2024-10-31 22:01:52,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8278 conditions, 3269 events. 2153/3269 cut-off events. For 1697/1813 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17266 event pairs, 401 based on Foata normal form. 65/2877 useless extension candidates. Maximal degree in co-relation 3488. Up to 1150 conditions per place. [2024-10-31 22:01:52,964 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 50 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-10-31 22:01:52,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 354 flow [2024-10-31 22:01:52,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:01:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2024-10-31 22:01:52,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2024-10-31 22:01:52,967 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 148 flow. Second operand 4 states and 124 transitions. [2024-10-31 22:01:52,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 354 flow [2024-10-31 22:01:52,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 73 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:01:52,971 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 178 flow [2024-10-31 22:01:52,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-10-31 22:01:52,972 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2024-10-31 22:01:52,972 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 178 flow [2024-10-31 22:01:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-31 22:01:52,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:52,973 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, 1] [2024-10-31 22:01:52,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:01:52,974 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-10-31 22:01:52,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:52,975 INFO L85 PathProgramCache]: Analyzing trace with hash -784589418, now seen corresponding path program 1 times [2024-10-31 22:01:52,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066427659] [2024-10-31 22:01:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-31 22:01:53,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066427659] [2024-10-31 22:01:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066427659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:01:53,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:01:53,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:01:53,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029478125] [2024-10-31 22:01:53,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:01:53,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:01:53,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:53,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:01:53,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:01:53,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2024-10-31 22:01:53,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-31 22:01:53,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:53,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2024-10-31 22:01:53,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:54,068 INFO L124 PetriNetUnfolderBase]: 3423/5060 cut-off events. [2024-10-31 22:01:54,069 INFO L125 PetriNetUnfolderBase]: For 6689/7414 co-relation queries the response was YES. [2024-10-31 22:01:54,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14582 conditions, 5060 events. 3423/5060 cut-off events. For 6689/7414 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 28126 event pairs, 791 based on Foata normal form. 188/4271 useless extension candidates. Maximal degree in co-relation 5151. Up to 1747 conditions per place. [2024-10-31 22:01:54,116 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 54 selfloop transitions, 5 changer transitions 0/77 dead transitions. [2024-10-31 22:01:54,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 432 flow [2024-10-31 22:01:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:01:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:01:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2024-10-31 22:01:54,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2024-10-31 22:01:54,118 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 178 flow. Second operand 4 states and 122 transitions. [2024-10-31 22:01:54,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 432 flow [2024-10-31 22:01:54,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 426 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-10-31 22:01:54,129 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 208 flow [2024-10-31 22:01:54,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-31 22:01:54,131 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-10-31 22:01:54,132 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 208 flow [2024-10-31 22:01:54,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-10-31 22:01:54,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:54,133 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] [2024-10-31 22:01:54,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:01:54,134 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-10-31 22:01:54,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash -298864946, now seen corresponding path program 1 times [2024-10-31 22:01:54,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168907066] [2024-10-31 22:01:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:54,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:54,483 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-31 22:01:54,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:54,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168907066] [2024-10-31 22:01:54,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168907066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:54,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544067135] [2024-10-31 22:01:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:54,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:54,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:54,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:01:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:54,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:01:54,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-31 22:01:54,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-31 22:01:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544067135] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:55,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 7] total 12 [2024-10-31 22:01:55,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905560992] [2024-10-31 22:01:55,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:55,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:01:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:55,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:01:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:01:55,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-10-31 22:01:55,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 208 flow. Second operand has 13 states, 13 states have (on average 19.53846153846154) internal successors, (254), 13 states have internal predecessors, (254), 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-10-31 22:01:55,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:55,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-10-31 22:01:55,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:01:58,628 INFO L124 PetriNetUnfolderBase]: 12044/17054 cut-off events. [2024-10-31 22:01:58,628 INFO L125 PetriNetUnfolderBase]: For 24861/26968 co-relation queries the response was YES. [2024-10-31 22:01:58,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52543 conditions, 17054 events. 12044/17054 cut-off events. For 24861/26968 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 98737 event pairs, 1305 based on Foata normal form. 1490/16807 useless extension candidates. Maximal degree in co-relation 18641. Up to 4101 conditions per place. [2024-10-31 22:01:58,785 INFO L140 encePairwiseOnDemand]: 32/42 looper letters, 240 selfloop transitions, 77 changer transitions 0/331 dead transitions. [2024-10-31 22:01:58,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 331 transitions, 2143 flow [2024-10-31 22:01:58,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-31 22:01:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-31 22:01:58,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 583 transitions. [2024-10-31 22:01:58,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2024-10-31 22:01:58,788 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 208 flow. Second operand 22 states and 583 transitions. [2024-10-31 22:01:58,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 331 transitions, 2143 flow [2024-10-31 22:01:58,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 331 transitions, 2131 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-10-31 22:01:58,814 INFO L231 Difference]: Finished difference. Result has 91 places, 121 transitions, 889 flow [2024-10-31 22:01:58,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=889, PETRI_PLACES=91, PETRI_TRANSITIONS=121} [2024-10-31 22:01:58,816 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places. [2024-10-31 22:01:58,817 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 121 transitions, 889 flow [2024-10-31 22:01:58,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.53846153846154) internal successors, (254), 13 states have internal predecessors, (254), 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-10-31 22:01:58,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:01:58,817 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:01:58,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 22:01:59,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-31 22:01:59,023 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-10-31 22:01:59,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:01:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2137944576, now seen corresponding path program 1 times [2024-10-31 22:01:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:01:59,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514756005] [2024-10-31 22:01:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:01:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:01:59,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514756005] [2024-10-31 22:01:59,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514756005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:01:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334787881] [2024-10-31 22:01:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:01:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:01:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:01:59,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:01:59,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:01:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:01:59,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-31 22:01:59,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:01:59,617 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:59,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:01:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 22:01:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334787881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:01:59,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:01:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-31 22:01:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051678502] [2024-10-31 22:01:59,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:01:59,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:01:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:01:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:01:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:01:59,718 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-31 22:01:59,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 121 transitions, 889 flow. Second operand has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-10-31 22:01:59,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:01:59,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-31 22:01:59,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:02:09,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][124], [Black: 63#(= ~g3~0 1), 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, Black: 51#(= ~pos~0 0), 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:09,143 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-31 22:02:09,144 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:02:09,144 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:02:09,144 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:02:09,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][124], [Black: 63#(= ~g3~0 1), 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 65#true, Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:09,817 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-31 22:02:09,817 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-31 22:02:09,817 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-31 22:02:09,818 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-31 22:02:12,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:12,998 INFO L294 olderBase$Statistics]: this new event has 62 ancestors and is cut-off event [2024-10-31 22:02:12,998 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-31 22:02:12,998 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-31 22:02:12,998 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-31 22:02:13,003 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,003 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-10-31 22:02:13,003 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,004 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,004 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 360#(= ~pos~0 2), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,005 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-10-31 22:02:13,005 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,005 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,005 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-31 22:02:13,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,011 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-10-31 22:02:13,011 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-31 22:02:13,011 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-31 22:02:13,011 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-31 22:02:13,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,020 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2024-10-31 22:02:13,021 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-31 22:02:13,021 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-31 22:02:13,021 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-10-31 22:02:13,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 67#(= ~g2~0 1), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,026 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-31 22:02:13,026 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,026 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,026 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,028 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-31 22:02:13,028 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,028 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,028 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-31 22:02:13,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][117], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 354#true, Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), 23#L75-1true, Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,034 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2024-10-31 22:02:13,034 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-31 22:02:13,034 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-31 22:02:13,034 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-31 22:02:13,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), 67#(= ~g2~0 1), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 6#L121-4true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,042 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is cut-off event [2024-10-31 22:02:13,042 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-31 22:02:13,042 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-31 22:02:13,042 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-31 22:02:13,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([336] L48-->L50: Formula: (= (+ v_~pos~0_19 1) v_~pos~0_20) InVars {~pos~0=v_~pos~0_20} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_19} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][61], [Black: 63#(= ~g3~0 1), 18#L122true, 20#L94true, Black: 68#(and (= ~g2~0 1) (not (= (mod ~d2~0 256) 0))), Black: 74#(and (not (= 0 (mod ~d3~0 256))) (= ~g3~0 1)), Black: 73#(= ~g3~0 1), Black: 323#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), Black: 319#(and (not (= 0 (mod ~d3~0 256))) (<= 1 (mod ~g1~0 256)) (not (= (mod ~g3~0 256) 0))), Black: 77#true, Black: 80#(and (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1)), Black: 79#(= ~g1~0 1), Black: 331#(and (not (= (mod ~d1~0 256) 0)) (<= 1 (mod ~g3~0 256)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 237#(< 0 (mod ~g1~0 256)), Black: 158#(and (= ~g1~0 1) (= ~g3~0 1)), 67#(= ~g2~0 1), Black: 211#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~g3~0 256) 0))), Black: 241#(and (not (= (mod ~d1~0 256) 0)) (not (= (mod (* 255 ~g1~0) 256) 0))), Black: 85#(and (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 315#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~g3~0 1)), Black: 335#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 207#(< 0 (mod ~g3~0 256)), Black: 313#(and (not (= 0 (mod ~d3~0 256))) (= ~g1~0 1) (= ~d1~0 1) (= ~g3~0 1)), Black: 327#(and (not (= 0 (mod ~d3~0 256))) (not (= (mod ~d1~0 256) 0)) (= ~g1~0 1) (not (= (mod ~g3~0 256) 0))), Black: 333#(and (= ~g1~0 1) (<= 1 (mod ~g3~0 256))), 8#L72true, 71#true, 329#(and (<= 1 (mod ~g1~0 256)) (<= 1 (mod ~g3~0 256))), Black: 51#(= ~pos~0 0), Black: 55#(= ~g2~0 1), 13#L50true, 360#(= ~pos~0 2), Black: 59#(and (<= (div ~g1~0 256) 0) (<= 1 ~g1~0))]) [2024-10-31 22:02:13,043 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2024-10-31 22:02:13,043 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-31 22:02:13,043 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-31 22:02:13,043 INFO L297 olderBase$Statistics]: existing Event has 51 ancestors and is cut-off event [2024-10-31 22:02:13,049 INFO L124 PetriNetUnfolderBase]: 45115/72593 cut-off events. [2024-10-31 22:02:13,049 INFO L125 PetriNetUnfolderBase]: For 286569/291863 co-relation queries the response was YES. [2024-10-31 22:02:13,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284268 conditions, 72593 events. 45115/72593 cut-off events. For 286569/291863 co-relation queries the response was YES. Maximal size of possible extension queue 2043. Compared 600149 event pairs, 4951 based on Foata normal form. 1887/72930 useless extension candidates. Maximal degree in co-relation 223676. Up to 22231 conditions per place. [2024-10-31 22:02:13,787 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 383 selfloop transitions, 34 changer transitions 1/463 dead transitions. [2024-10-31 22:02:13,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 463 transitions, 4493 flow [2024-10-31 22:02:13,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:02:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 22:02:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 245 transitions. [2024-10-31 22:02:13,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-10-31 22:02:13,789 INFO L175 Difference]: Start difference. First operand has 91 places, 121 transitions, 889 flow. Second operand 7 states and 245 transitions. [2024-10-31 22:02:13,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 463 transitions, 4493 flow [2024-10-31 22:02:15,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 463 transitions, 4201 flow, removed 146 selfloop flow, removed 0 redundant places. [2024-10-31 22:02:15,566 INFO L231 Difference]: Finished difference. Result has 98 places, 151 transitions, 1052 flow [2024-10-31 22:02:15,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1052, PETRI_PLACES=98, PETRI_TRANSITIONS=151} [2024-10-31 22:02:15,571 INFO L277 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2024-10-31 22:02:15,571 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 151 transitions, 1052 flow [2024-10-31 22:02:15,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 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-10-31 22:02:15,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:02:15,572 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:02:15,586 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:02:15,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-31 22:02:15,775 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-10-31 22:02:15,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:02:15,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1970211960, now seen corresponding path program 2 times [2024-10-31 22:02:15,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:02:15,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237420083] [2024-10-31 22:02:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:02:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:02:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:02:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:02:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:02:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237420083] [2024-10-31 22:02:15,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237420083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:02:15,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012456446] [2024-10-31 22:02:15,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:02:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:02:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:02:15,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:02:15,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2bec80a8-1c64-43e6-ac8a-4cbf2b6c7be3/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:02:16,060 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:02:16,060 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:02:16,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-31 22:02:16,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:02:16,139 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:02:16,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:02:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 22:02:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012456446] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:02:16,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:02:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-10-31 22:02:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612757634] [2024-10-31 22:02:16,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:02:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:02:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:02:16,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:02:16,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:02:16,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-10-31 22:02:16,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 151 transitions, 1052 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 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-10-31 22:02:16,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:02:16,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-10-31 22:02:16,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand