./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX --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 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:53:27,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:53:28,046 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 16:53:28,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:53:28,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:53:28,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:53:28,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:53:28,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:53:28,088 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:53:28,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:53:28,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:53:28,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:53:28,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:53:28,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:53:28,094 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:53:28,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:53:28,095 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:53:28,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:53:28,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:53:28,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:53:28,096 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 16:53:28,097 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 16:53:28,097 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 16:53:28,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:53:28,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:53:28,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:53:28,099 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:53:28,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:53:28,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:53:28,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:53:28,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:53:28,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:53:28,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:53:28,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:53:28,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:53:28,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:53:28,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:53:28,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:53:28,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:53:28,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:53:28,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:53:28,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:53:28,103 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_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/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_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX 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 -> 74892b4fb04a6fe0e809c110df08d9da57c5c90ea65da5b04a32432686fc90f8 [2024-11-08 16:53:28,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:53:28,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:53:28,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:53:28,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:53:28,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:53:28,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/weaver/popl20-difference-det.wvr.c Unable to find full path for "g++" [2024-11-08 16:53:30,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:53:30,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:53:30,720 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/sv-benchmarks/c/weaver/popl20-difference-det.wvr.c [2024-11-08 16:53:30,729 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/data/eaf22c729/098ef58c95b14d74a4b098cc8e5e6525/FLAG33bde10eb [2024-11-08 16:53:31,097 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/data/eaf22c729/098ef58c95b14d74a4b098cc8e5e6525 [2024-11-08 16:53:31,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:53:31,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:53:31,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:53:31,103 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:53:31,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:53:31,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ed2489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31, skipping insertion in model container [2024-11-08 16:53:31,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:53:31,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:53:31,366 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:53:31,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:53:31,405 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:53:31,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31 WrapperNode [2024-11-08 16:53:31,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:53:31,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:53:31,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:53:31,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:53:31,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,444 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 99 [2024-11-08 16:53:31,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:53:31,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:53:31,445 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:53:31,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:53:31,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,475 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:53:31,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,480 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:53:31,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:53:31,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:53:31,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:53:31,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (1/1) ... [2024-11-08 16:53:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:53:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:53:31,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:53:31,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:53:31,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:53:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-08 16:53:31,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-08 16:53:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-08 16:53:31,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-08 16:53:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-08 16:53:31,571 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-08 16:53:31,571 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-08 16:53:31,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-08 16:53:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:53:31,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:53:31,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:53:31,574 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-08 16:53:31,664 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:53:31,666 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:53:31,913 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-08 16:53:31,913 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:53:32,128 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:53:32,129 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:53:32,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:53:32 BoogieIcfgContainer [2024-11-08 16:53:32,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:53:32,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:53:32,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:53:32,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:53:32,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:53:31" (1/3) ... [2024-11-08 16:53:32,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62df89b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:53:32, skipping insertion in model container [2024-11-08 16:53:32,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:53:31" (2/3) ... [2024-11-08 16:53:32,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62df89b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:53:32, skipping insertion in model container [2024-11-08 16:53:32,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:53:32" (3/3) ... [2024-11-08 16:53:32,137 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2024-11-08 16:53:32,155 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:53:32,155 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 16:53:32,156 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-08 16:53:32,218 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-08 16:53:32,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 54 transitions, 136 flow [2024-11-08 16:53:32,288 INFO L124 PetriNetUnfolderBase]: 8/50 cut-off events. [2024-11-08 16:53:32,289 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:53:32,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 50 events. 8/50 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-11-08 16:53:32,293 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 54 transitions, 136 flow [2024-11-08 16:53:32,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 49 transitions, 122 flow [2024-11-08 16:53:32,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:53:32,313 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;@53059dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:53:32,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-08 16:53:32,331 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-08 16:53:32,331 INFO L124 PetriNetUnfolderBase]: 8/46 cut-off events. [2024-11-08 16:53:32,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-08 16:53:32,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:32,332 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:32,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:32,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1244229052, now seen corresponding path program 1 times [2024-11-08 16:53:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328689755] [2024-11-08 16:53:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:32,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328689755] [2024-11-08 16:53:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328689755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:32,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:53:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416202923] [2024-11-08 16:53:32,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:32,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:53:32,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:32,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:53:32,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:53:32,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2024-11-08 16:53:32,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:32,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:32,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2024-11-08 16:53:32,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:33,842 INFO L124 PetriNetUnfolderBase]: 4371/6178 cut-off events. [2024-11-08 16:53:33,842 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-08 16:53:33,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12166 conditions, 6178 events. 4371/6178 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 31473 event pairs, 1080 based on Foata normal form. 126/5929 useless extension candidates. Maximal degree in co-relation 10803. Up to 4714 conditions per place. [2024-11-08 16:53:33,911 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 48 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2024-11-08 16:53:33,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 287 flow [2024-11-08 16:53:33,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:53:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-08 16:53:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-11-08 16:53:33,925 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2024-11-08 16:53:33,927 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 122 flow. Second operand 3 states and 117 transitions. [2024-11-08 16:53:33,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 287 flow [2024-11-08 16:53:33,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 257 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-08 16:53:33,947 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 125 flow [2024-11-08 16:53:33,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2024-11-08 16:53:33,959 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2024-11-08 16:53:33,959 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 125 flow [2024-11-08 16:53:33,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:33,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:33,960 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:33,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:53:33,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:33,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 812327758, now seen corresponding path program 1 times [2024-11-08 16:53:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645742220] [2024-11-08 16:53:33,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:33,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645742220] [2024-11-08 16:53:34,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645742220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:34,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:34,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:53:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52967816] [2024-11-08 16:53:34,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:34,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:53:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:34,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:53:34,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:53:34,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-08 16:53:34,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:34,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:34,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-08 16:53:34,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:36,925 INFO L124 PetriNetUnfolderBase]: 18265/23984 cut-off events. [2024-11-08 16:53:36,928 INFO L125 PetriNetUnfolderBase]: For 2233/2271 co-relation queries the response was YES. [2024-11-08 16:53:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51346 conditions, 23984 events. 18265/23984 cut-off events. For 2233/2271 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 128913 event pairs, 5173 based on Foata normal form. 0/22017 useless extension candidates. Maximal degree in co-relation 8682. Up to 12108 conditions per place. [2024-11-08 16:53:37,101 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 129 selfloop transitions, 18 changer transitions 0/156 dead transitions. [2024-11-08 16:53:37,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 156 transitions, 688 flow [2024-11-08 16:53:37,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:53:37,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:53:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-11-08 16:53:37,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7067901234567902 [2024-11-08 16:53:37,108 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 125 flow. Second operand 6 states and 229 transitions. [2024-11-08 16:53:37,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 156 transitions, 688 flow [2024-11-08 16:53:37,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 156 transitions, 678 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:53:37,113 INFO L231 Difference]: Finished difference. Result has 55 places, 66 transitions, 253 flow [2024-11-08 16:53:37,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=66} [2024-11-08 16:53:37,115 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2024-11-08 16:53:37,115 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 66 transitions, 253 flow [2024-11-08 16:53:37,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:37,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:37,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:37,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:53:37,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:37,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash 665216626, now seen corresponding path program 1 times [2024-11-08 16:53:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050494386] [2024-11-08 16:53:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:37,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:37,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050494386] [2024-11-08 16:53:37,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050494386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:37,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:37,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:53:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36532968] [2024-11-08 16:53:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:37,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:53:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:53:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:53:37,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-08 16:53:37,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 66 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:37,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:37,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-08 16:53:37,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:41,003 INFO L124 PetriNetUnfolderBase]: 32247/41342 cut-off events. [2024-11-08 16:53:41,004 INFO L125 PetriNetUnfolderBase]: For 27847/30405 co-relation queries the response was YES. [2024-11-08 16:53:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112781 conditions, 41342 events. 32247/41342 cut-off events. For 27847/30405 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 220043 event pairs, 11895 based on Foata normal form. 846/40645 useless extension candidates. Maximal degree in co-relation 32757. Up to 26346 conditions per place. [2024-11-08 16:53:41,442 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 126 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2024-11-08 16:53:41,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 147 transitions, 811 flow [2024-11-08 16:53:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:53:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 16:53:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2024-11-08 16:53:41,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2024-11-08 16:53:41,445 INFO L175 Difference]: Start difference. First operand has 55 places, 66 transitions, 253 flow. Second operand 5 states and 178 transitions. [2024-11-08 16:53:41,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 147 transitions, 811 flow [2024-11-08 16:53:41,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 147 transitions, 811 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-08 16:53:41,475 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 332 flow [2024-11-08 16:53:41,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2024-11-08 16:53:41,476 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2024-11-08 16:53:41,476 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 332 flow [2024-11-08 16:53:41,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:41,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:41,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:41,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:53:41,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:41,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1236292556, now seen corresponding path program 2 times [2024-11-08 16:53:41,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:41,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824612753] [2024-11-08 16:53:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:41,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:41,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:41,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824612753] [2024-11-08 16:53:41,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824612753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:41,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:41,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:53:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808573726] [2024-11-08 16:53:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:41,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:53:41,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:53:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:53:41,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-08 16:53:41,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:41,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:41,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-08 16:53:41,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:45,346 INFO L124 PetriNetUnfolderBase]: 31262/41571 cut-off events. [2024-11-08 16:53:45,347 INFO L125 PetriNetUnfolderBase]: For 46041/46750 co-relation queries the response was YES. [2024-11-08 16:53:45,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125977 conditions, 41571 events. 31262/41571 cut-off events. For 46041/46750 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 248612 event pairs, 3220 based on Foata normal form. 1634/42909 useless extension candidates. Maximal degree in co-relation 38612. Up to 17745 conditions per place. [2024-11-08 16:53:45,736 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 177 selfloop transitions, 15 changer transitions 0/202 dead transitions. [2024-11-08 16:53:45,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 202 transitions, 1211 flow [2024-11-08 16:53:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 16:53:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 262 transitions. [2024-11-08 16:53:45,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2024-11-08 16:53:45,741 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 332 flow. Second operand 7 states and 262 transitions. [2024-11-08 16:53:45,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 202 transitions, 1211 flow [2024-11-08 16:53:45,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 202 transitions, 1207 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-08 16:53:45,908 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 433 flow [2024-11-08 16:53:45,909 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2024-11-08 16:53:45,910 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 19 predicate places. [2024-11-08 16:53:45,912 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 433 flow [2024-11-08 16:53:45,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:45,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:45,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:45,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:53:45,914 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1157235248, now seen corresponding path program 3 times [2024-11-08 16:53:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441101014] [2024-11-08 16:53:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:46,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:46,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:46,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441101014] [2024-11-08 16:53:46,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441101014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:46,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:46,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:53:46,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624520633] [2024-11-08 16:53:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:53:46,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:46,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:53:46,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:53:46,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2024-11-08 16:53:46,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 433 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:46,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:46,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2024-11-08 16:53:46,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:50,433 INFO L124 PetriNetUnfolderBase]: 30338/40570 cut-off events. [2024-11-08 16:53:50,433 INFO L125 PetriNetUnfolderBase]: For 81700/82575 co-relation queries the response was YES. [2024-11-08 16:53:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132380 conditions, 40570 events. 30338/40570 cut-off events. For 81700/82575 co-relation queries the response was YES. Maximal size of possible extension queue 1705. Compared 242670 event pairs, 10576 based on Foata normal form. 704/40313 useless extension candidates. Maximal degree in co-relation 96584. Up to 19429 conditions per place. [2024-11-08 16:53:50,801 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 139 selfloop transitions, 20 changer transitions 0/173 dead transitions. [2024-11-08 16:53:50,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 173 transitions, 1150 flow [2024-11-08 16:53:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 16:53:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-11-08 16:53:50,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-11-08 16:53:50,803 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 433 flow. Second operand 7 states and 237 transitions. [2024-11-08 16:53:50,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 173 transitions, 1150 flow [2024-11-08 16:53:51,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 173 transitions, 1137 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-08 16:53:51,065 INFO L231 Difference]: Finished difference. Result has 83 places, 81 transitions, 557 flow [2024-11-08 16:53:51,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=557, PETRI_PLACES=83, PETRI_TRANSITIONS=81} [2024-11-08 16:53:51,067 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2024-11-08 16:53:51,067 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 81 transitions, 557 flow [2024-11-08 16:53:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:51,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:51,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:53:51,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -775736176, now seen corresponding path program 2 times [2024-11-08 16:53:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898359122] [2024-11-08 16:53:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:51,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898359122] [2024-11-08 16:53:51,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898359122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:53:51,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:53:51,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:53:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196215212] [2024-11-08 16:53:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:53:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:53:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:53:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:53:51,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 54 [2024-11-08 16:53:51,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 81 transitions, 557 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:51,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:51,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 54 [2024-11-08 16:53:51,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:53:53,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 18#$Ultimate##0true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 77#true, 14#L67-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:53,757 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-08 16:53:53,757 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 16:53:53,757 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 16:53:53,757 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-08 16:53:54,087 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 8#L48-7true, 14#L67-2true, 77#true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:54,087 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,087 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,088 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,088 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 18#$Ultimate##0true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 37#L84true, 77#true, 14#L67-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,372 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,373 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,373 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-08 16:53:54,373 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 77#true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 5#thread2EXITtrue, Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,513 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,513 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,513 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,513 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 9#L50true, 77#true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:54,587 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,588 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,588 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,588 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 77#true, 14#L67-2true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 5#thread2EXITtrue, Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,613 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 9#L50true, 77#true, 14#L67-2true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,613 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,613 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 8#L48-7true, 37#L84true, 77#true, 14#L67-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,614 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,614 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-08 16:53:54,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 37#L84true, 77#true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 5#thread2EXITtrue, Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,763 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,763 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,763 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,763 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 9#L50true, 37#L84true, 77#true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:54,821 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,821 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,821 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,821 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,823 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 77#true, 36#L50-2true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:54,823 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,823 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,823 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,824 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-08 16:53:54,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 37#L84true, 77#true, 14#L67-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 5#thread2EXITtrue, Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:54,844 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 9#L50true, 37#L84true, 14#L67-2true, 77#true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:54,845 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:54,845 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 49#L83-4true, 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 77#true, 14#L67-2true, 36#L50-2true, Black: 101#(<= ~M~0 0), 52#L41true, Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:55,001 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,001 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,001 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,001 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:55,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 33#L67true, 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 37#L84true, 77#true, 36#L50-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, 116#(= thread1Thread1of1ForFork3_~i~0 0), Black: 100#(= thread3Thread1of1ForFork2_~i~2 0)]) [2024-11-08 16:53:55,002 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,002 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-08 16:53:55,002 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:55,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([364] L57-8-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork2_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_1|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_1|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_7} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_~i~2][138], [Black: 64#(and (= ~counter1~0 0) (= ~counter2~0 0)), 88#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), Black: 69#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0)), Black: 72#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 70#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 80#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), Black: 79#(= thread3Thread1of1ForFork2_~i~2 0), Black: 81#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 98#true, Black: 90#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= 1 ~M~0)), 68#(= thread1Thread1of1ForFork3_~i~0 0), Black: 87#(= thread1Thread1of1ForFork3_~i~0 0), Black: 89#(<= 1 ~M~0), Black: 92#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= 1 ~M~0)), 37#L84true, 14#L67-2true, 77#true, 36#L50-2true, 52#L41true, Black: 101#(<= ~M~0 0), Black: 104#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~M~0 0)), Black: 107#(and (= thread3Thread1of1ForFork2_~i~2 0) (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), Black: 102#(and (= thread1Thread1of1ForFork3_~i~0 0) (<= ~M~0 0)), 40#thread3EXITtrue, Black: 100#(= thread3Thread1of1ForFork2_~i~2 0), 116#(= thread1Thread1of1ForFork3_~i~0 0)]) [2024-11-08 16:53:55,500 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-08 16:53:55,500 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:55,500 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-08 16:53:55,501 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-08 16:53:55,791 INFO L124 PetriNetUnfolderBase]: 33727/44591 cut-off events. [2024-11-08 16:53:55,791 INFO L125 PetriNetUnfolderBase]: For 104904/106446 co-relation queries the response was YES. [2024-11-08 16:53:55,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151844 conditions, 44591 events. 33727/44591 cut-off events. For 104904/106446 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 263643 event pairs, 10682 based on Foata normal form. 248/42799 useless extension candidates. Maximal degree in co-relation 138093. Up to 23993 conditions per place. [2024-11-08 16:53:56,035 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 152 selfloop transitions, 22 changer transitions 0/188 dead transitions. [2024-11-08 16:53:56,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 188 transitions, 1334 flow [2024-11-08 16:53:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:53:56,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-08 16:53:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 247 transitions. [2024-11-08 16:53:56,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6534391534391535 [2024-11-08 16:53:56,036 INFO L175 Difference]: Start difference. First operand has 83 places, 81 transitions, 557 flow. Second operand 7 states and 247 transitions. [2024-11-08 16:53:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 188 transitions, 1334 flow [2024-11-08 16:53:56,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 188 transitions, 1309 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-08 16:53:56,257 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 667 flow [2024-11-08 16:53:56,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-11-08 16:53:56,258 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2024-11-08 16:53:56,258 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 667 flow [2024-11-08 16:53:56,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:56,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:53:56,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:53:56,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:53:56,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:53:56,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:53:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash 221009684, now seen corresponding path program 3 times [2024-11-08 16:53:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:53:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470355845] [2024-11-08 16:53:56,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:53:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:53:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:53:56,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:53:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470355845] [2024-11-08 16:53:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470355845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:53:56,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112943989] [2024-11-08 16:53:56,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 16:53:56,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:53:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:53:56,373 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:53:56,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:53:56,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-08 16:53:56,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 16:53:56,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 16:53:56,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:53:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:56,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:53:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:53:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112943989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:53:56,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:53:56,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-08 16:53:56,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387507444] [2024-11-08 16:53:56,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:53:56,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:53:56,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:53:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:53:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:53:56,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-08 16:53:56,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 667 flow. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:53:56,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:53:56,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-08 16:53:56,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:54:03,547 INFO L124 PetriNetUnfolderBase]: 50285/65364 cut-off events. [2024-11-08 16:54:03,548 INFO L125 PetriNetUnfolderBase]: For 184183/184183 co-relation queries the response was YES. [2024-11-08 16:54:03,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226835 conditions, 65364 events. 50285/65364 cut-off events. For 184183/184183 co-relation queries the response was YES. Maximal size of possible extension queue 2410. Compared 377648 event pairs, 2610 based on Foata normal form. 1392/66595 useless extension candidates. Maximal degree in co-relation 182727. Up to 11715 conditions per place. [2024-11-08 16:54:04,094 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 280 selfloop transitions, 56 changer transitions 6/349 dead transitions. [2024-11-08 16:54:04,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 349 transitions, 2535 flow [2024-11-08 16:54:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:54:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-08 16:54:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 455 transitions. [2024-11-08 16:54:04,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2024-11-08 16:54:04,098 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 667 flow. Second operand 14 states and 455 transitions. [2024-11-08 16:54:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 349 transitions, 2535 flow [2024-11-08 16:54:05,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 349 transitions, 2498 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-08 16:54:05,116 INFO L231 Difference]: Finished difference. Result has 108 places, 114 transitions, 1107 flow [2024-11-08 16:54:05,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1107, PETRI_PLACES=108, PETRI_TRANSITIONS=114} [2024-11-08 16:54:05,117 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 54 predicate places. [2024-11-08 16:54:05,117 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 114 transitions, 1107 flow [2024-11-08 16:54:05,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:05,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:54:05,118 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:54:05,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 16:54:05,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaaa81ca-7eb5-480b-98dc-293d25bbcfe2/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 16:54:05,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:54:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash 664239614, now seen corresponding path program 4 times [2024-11-08 16:54:05,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:54:05,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202676699] [2024-11-08 16:54:05,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:05,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:54:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:54:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:54:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202676699] [2024-11-08 16:54:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202676699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:54:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718353432] [2024-11-08 16:54:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:05,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:54:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:54:05,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:54:05,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:54:05,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-08 16:54:05,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 114 transitions, 1107 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:05,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:54:05,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-08 16:54:05,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:54:12,443 INFO L124 PetriNetUnfolderBase]: 49538/64467 cut-off events. [2024-11-08 16:54:12,443 INFO L125 PetriNetUnfolderBase]: For 243363/243377 co-relation queries the response was YES. [2024-11-08 16:54:13,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233614 conditions, 64467 events. 49538/64467 cut-off events. For 243363/243377 co-relation queries the response was YES. Maximal size of possible extension queue 2413. Compared 370519 event pairs, 18715 based on Foata normal form. 218/64307 useless extension candidates. Maximal degree in co-relation 203419. Up to 37117 conditions per place. [2024-11-08 16:54:13,355 INFO L140 encePairwiseOnDemand]: 43/54 looper letters, 147 selfloop transitions, 35 changer transitions 0/189 dead transitions. [2024-11-08 16:54:13,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 189 transitions, 1834 flow [2024-11-08 16:54:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:54:13,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-08 16:54:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2024-11-08 16:54:13,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2024-11-08 16:54:13,357 INFO L175 Difference]: Start difference. First operand has 108 places, 114 transitions, 1107 flow. Second operand 5 states and 176 transitions. [2024-11-08 16:54:13,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 189 transitions, 1834 flow [2024-11-08 16:54:14,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 189 transitions, 1704 flow, removed 45 selfloop flow, removed 5 redundant places. [2024-11-08 16:54:14,955 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 1137 flow [2024-11-08 16:54:14,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1137, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2024-11-08 16:54:14,956 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2024-11-08 16:54:14,956 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 1137 flow [2024-11-08 16:54:14,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:14,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:54:14,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:54:14,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 16:54:14,957 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:54:14,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1027200584, now seen corresponding path program 5 times [2024-11-08 16:54:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:54:14,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674975725] [2024-11-08 16:54:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:54:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:54:15,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:54:15,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674975725] [2024-11-08 16:54:15,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674975725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:15,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:15,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:54:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262629629] [2024-11-08 16:54:15,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:15,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:54:15,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:54:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:54:15,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:54:15,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-08 16:54:15,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 1137 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:15,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:54:15,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-08 16:54:15,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-08 16:54:20,268 INFO L124 PetriNetUnfolderBase]: 37038/49764 cut-off events. [2024-11-08 16:54:20,269 INFO L125 PetriNetUnfolderBase]: For 198760/199446 co-relation queries the response was YES. [2024-11-08 16:54:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185864 conditions, 49764 events. 37038/49764 cut-off events. For 198760/199446 co-relation queries the response was YES. Maximal size of possible extension queue 2096. Compared 304066 event pairs, 14498 based on Foata normal form. 450/49300 useless extension candidates. Maximal degree in co-relation 161005. Up to 26850 conditions per place. [2024-11-08 16:54:20,698 INFO L140 encePairwiseOnDemand]: 44/54 looper letters, 158 selfloop transitions, 38 changer transitions 0/209 dead transitions. [2024-11-08 16:54:20,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 209 transitions, 2024 flow [2024-11-08 16:54:20,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 16:54:20,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-08 16:54:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2024-11-08 16:54:20,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-08 16:54:20,700 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 1137 flow. Second operand 6 states and 216 transitions. [2024-11-08 16:54:20,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 209 transitions, 2024 flow [2024-11-08 16:54:21,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 209 transitions, 1918 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-11-08 16:54:21,692 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 1383 flow [2024-11-08 16:54:21,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1383, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2024-11-08 16:54:21,693 INFO L277 CegarLoopForPetriNet]: 54 programPoint places, 59 predicate places. [2024-11-08 16:54:21,693 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 1383 flow [2024-11-08 16:54:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:21,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-08 16:54:21,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:54:21,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 16:54:21,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-08 16:54:21,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:54:21,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2016846064, now seen corresponding path program 4 times [2024-11-08 16:54:21,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:54:21,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990268941] [2024-11-08 16:54:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:54:21,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:54:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:54:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:54:21,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:54:21,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990268941] [2024-11-08 16:54:21,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990268941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:54:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:54:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:54:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298531282] [2024-11-08 16:54:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:54:21,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:54:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:54:21,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:54:21,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:54:21,815 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 54 [2024-11-08 16:54:21,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 131 transitions, 1383 flow. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:54:21,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-08 16:54:21,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 54 [2024-11-08 16:54:21,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand