./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:09:02,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:09:02,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 01:09:02,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:09:02,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:09:02,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:09:02,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:09:02,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:09:02,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:09:02,491 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:09:02,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:09:02,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:09:02,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:09:02,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:09:02,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:02,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:02,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:09:02,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:09:02,494 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbff9cba9b3794b18d55ca52c1abf6279404a7b220f91d79730a04b586f9ee44 [2025-01-10 01:09:02,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:09:02,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:09:02,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:09:02,880 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:09:02,880 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:09:02,882 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-01-10 01:09:04,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9e77c48/45e35ff34b6b428d9156980de129a479/FLAG702a354e9 [2025-01-10 01:09:04,252 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:09:04,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult2.wvr.c [2025-01-10 01:09:04,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9e77c48/45e35ff34b6b428d9156980de129a479/FLAG702a354e9 [2025-01-10 01:09:04,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d9e77c48/45e35ff34b6b428d9156980de129a479 [2025-01-10 01:09:04,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:09:04,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:09:04,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:04,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:09:04,318 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:09:04,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68001dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04, skipping insertion in model container [2025-01-10 01:09:04,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:09:04,472 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 01:09:04,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:04,484 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:09:04,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:09:04,525 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:09:04,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04 WrapperNode [2025-01-10 01:09:04,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:09:04,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:04,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:09:04,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:09:04,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,571 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 276 [2025-01-10 01:09:04,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:09:04,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:09:04,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:09:04,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:09:04,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,605 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 01:09:04,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:09:04,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:09:04,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:09:04,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:09:04,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (1/1) ... [2025-01-10 01:09:04,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:09:04,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:04,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 01:09:04,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:09:04,692 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 01:09:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 01:09:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 01:09:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 01:09:04,693 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 01:09:04,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 01:09:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 01:09:04,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:09:04,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:09:04,695 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 01:09:04,782 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:09:04,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:09:05,144 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 01:09:05,144 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:09:05,412 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:09:05,413 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:09:05,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:05 BoogieIcfgContainer [2025-01-10 01:09:05,413 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:09:05,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:09:05,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:09:05,418 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:09:05,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:09:04" (1/3) ... [2025-01-10 01:09:05,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170e1652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:05, skipping insertion in model container [2025-01-10 01:09:05,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:09:04" (2/3) ... [2025-01-10 01:09:05,419 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170e1652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:09:05, skipping insertion in model container [2025-01-10 01:09:05,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:09:05" (3/3) ... [2025-01-10 01:09:05,420 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult2.wvr.c [2025-01-10 01:09:05,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:09:05,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult2.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-01-10 01:09:05,453 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 01:09:05,507 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 01:09:05,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 64 transitions, 156 flow [2025-01-10 01:09:05,564 INFO L124 PetriNetUnfolderBase]: 6/60 cut-off events. [2025-01-10 01:09:05,566 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:05,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 60 events. 6/60 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2025-01-10 01:09:05,570 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 64 transitions, 156 flow [2025-01-10 01:09:05,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 59 transitions, 142 flow [2025-01-10 01:09:05,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:09:05,593 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;@9fcd06b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:09:05,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-10 01:09:05,598 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 01:09:05,599 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-01-10 01:09:05,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:05,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:05,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:05,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 813292, now seen corresponding path program 1 times [2025-01-10 01:09:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271796284] [2025-01-10 01:09:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:05,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:05,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:05,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:05,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:05,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:05,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271796284] [2025-01-10 01:09:05,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271796284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:05,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:05,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 01:09:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353994900] [2025-01-10 01:09:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:05,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:05,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:05,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2025-01-10 01:09:05,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:05,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:05,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:06,611 INFO L124 PetriNetUnfolderBase]: 4566/6759 cut-off events. [2025-01-10 01:09:06,612 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2025-01-10 01:09:06,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13365 conditions, 6759 events. 4566/6759 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49900 event pairs, 4408 based on Foata normal form. 1/3814 useless extension candidates. Maximal degree in co-relation 12180. Up to 6127 conditions per place. [2025-01-10 01:09:06,672 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 01:09:06,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 206 flow [2025-01-10 01:09:06,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-10 01:09:06,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-10 01:09:06,684 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 142 flow. Second operand 3 states and 111 transitions. [2025-01-10 01:09:06,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 206 flow [2025-01-10 01:09:06,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 190 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:06,698 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 122 flow [2025-01-10 01:09:06,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-01-10 01:09:06,702 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2025-01-10 01:09:06,702 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 122 flow [2025-01-10 01:09:06,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2025-01-10 01:09:06,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:06,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 01:09:06,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:09:06,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:06,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:06,703 INFO L85 PathProgramCache]: Analyzing trace with hash 813293, now seen corresponding path program 1 times [2025-01-10 01:09:06,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:06,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053227223] [2025-01-10 01:09:06,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:06,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:06,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 01:09:06,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 01:09:06,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:06,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:06,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:06,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053227223] [2025-01-10 01:09:06,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053227223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:06,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:06,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:06,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51342679] [2025-01-10 01:09:06,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:06,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:06,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:06,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:06,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:06,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:06,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2025-01-10 01:09:06,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:06,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:06,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:07,558 INFO L124 PetriNetUnfolderBase]: 4567/6762 cut-off events. [2025-01-10 01:09:07,558 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:07,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13060 conditions, 6762 events. 4567/6762 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49868 event pairs, 4408 based on Foata normal form. 0/3814 useless extension candidates. Maximal degree in co-relation 13031. Up to 6136 conditions per place. [2025-01-10 01:09:07,615 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 37 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-01-10 01:09:07,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 210 flow [2025-01-10 01:09:07,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:07,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-01-10 01:09:07,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2025-01-10 01:09:07,619 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 122 flow. Second operand 4 states and 138 transitions. [2025-01-10 01:09:07,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 210 flow [2025-01-10 01:09:07,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:07,622 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 145 flow [2025-01-10 01:09:07,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=145, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2025-01-10 01:09:07,624 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -7 predicate places. [2025-01-10 01:09:07,624 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 145 flow [2025-01-10 01:09:07,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2025-01-10 01:09:07,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:07,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 01:09:07,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 01:09:07,625 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:07,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash 25214156, now seen corresponding path program 1 times [2025-01-10 01:09:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:07,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-01-10 01:09:07,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:07,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:07,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:09:07,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:09:07,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:07,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006242003] [2025-01-10 01:09:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006242003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047553734] [2025-01-10 01:09:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:07,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:07,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:07,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:07,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:07,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:07,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:07,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:08,384 INFO L124 PetriNetUnfolderBase]: 4568/6765 cut-off events. [2025-01-10 01:09:08,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 01:09:08,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13077 conditions, 6765 events. 4568/6765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 49985 event pairs, 4408 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 13052. Up to 6135 conditions per place. [2025-01-10 01:09:08,412 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 37 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-01-10 01:09:08,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 239 flow [2025-01-10 01:09:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2025-01-10 01:09:08,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.515625 [2025-01-10 01:09:08,414 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 145 flow. Second operand 5 states and 165 transitions. [2025-01-10 01:09:08,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 239 flow [2025-01-10 01:09:08,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:08,417 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 179 flow [2025-01-10 01:09:08,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2025-01-10 01:09:08,418 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-01-10 01:09:08,418 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 179 flow [2025-01-10 01:09:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:08,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:08,419 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-01-10 01:09:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:09:08,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash 781600807, now seen corresponding path program 1 times [2025-01-10 01:09:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598449810] [2025-01-10 01:09:08,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:08,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:08,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:08,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598449810] [2025-01-10 01:09:08,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598449810] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:08,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647555799] [2025-01-10 01:09:08,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:08,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:08,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:08,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:08,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 01:09:08,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 01:09:08,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 01:09:08,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:08,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:08,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:09:08,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:08,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:09:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:08,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647555799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:08,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-01-10 01:09:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418177776] [2025-01-10 01:09:08,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 01:09:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 01:09:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-10 01:09:09,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:09,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 179 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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) [2025-01-10 01:09:09,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:09,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:09,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:09,810 INFO L124 PetriNetUnfolderBase]: 4569/6767 cut-off events. [2025-01-10 01:09:09,810 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:09,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13100 conditions, 6767 events. 4569/6767 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 50042 event pairs, 4408 based on Foata normal form. 0/3821 useless extension candidates. Maximal degree in co-relation 13062. Up to 6136 conditions per place. [2025-01-10 01:09:09,858 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 36 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-01-10 01:09:09,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 282 flow [2025-01-10 01:09:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 01:09:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 01:09:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 237 transitions. [2025-01-10 01:09:09,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.462890625 [2025-01-10 01:09:09,861 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 179 flow. Second operand 8 states and 237 transitions. [2025-01-10 01:09:09,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 282 flow [2025-01-10 01:09:09,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:09,863 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 209 flow [2025-01-10 01:09:09,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 01:09:09,865 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-01-10 01:09:09,865 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 209 flow [2025-01-10 01:09:09,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 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) [2025-01-10 01:09:09,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:09,866 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 01:09:09,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 01:09:10,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:10,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:10,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1538973514, now seen corresponding path program 1 times [2025-01-10 01:09:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-01-10 01:09:10,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:10,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:10,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:10,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:10,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000567635] [2025-01-10 01:09:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000567635] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735988690] [2025-01-10 01:09:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:10,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:10,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:10,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:10,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 01:09:10,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 01:09:10,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 01:09:10,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:10,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 01:09:10,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:10,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-01-10 01:09:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:10,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:09:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:10,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735988690] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:09:10,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:09:10,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-01-10 01:09:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888775743] [2025-01-10 01:09:10,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:09:10,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 01:09:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:10,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 01:09:10,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-10 01:09:10,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:10,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 209 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:10,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:10,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:10,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:11,335 INFO L124 PetriNetUnfolderBase]: 4569/6766 cut-off events. [2025-01-10 01:09:11,335 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 01:09:11,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13107 conditions, 6766 events. 4569/6766 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 739. Compared 50140 event pairs, 4408 based on Foata normal form. 0/3821 useless extension candidates. Maximal degree in co-relation 13061. Up to 6127 conditions per place. [2025-01-10 01:09:11,374 INFO L140 encePairwiseOnDemand]: 56/64 looper letters, 30 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2025-01-10 01:09:11,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 62 transitions, 295 flow [2025-01-10 01:09:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions. [2025-01-10 01:09:11,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47098214285714285 [2025-01-10 01:09:11,376 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 209 flow. Second operand 7 states and 211 transitions. [2025-01-10 01:09:11,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 62 transitions, 295 flow [2025-01-10 01:09:11,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 248 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 01:09:11,380 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 188 flow [2025-01-10 01:09:11,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-01-10 01:09:11,383 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2025-01-10 01:09:11,383 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 188 flow [2025-01-10 01:09:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:11,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:11,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:11,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:11,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1410097312, now seen corresponding path program 1 times [2025-01-10 01:09:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944470838] [2025-01-10 01:09:11,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:11,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:11,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:09:11,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:09:11,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:11,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944470838] [2025-01-10 01:09:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944470838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747500672] [2025-01-10 01:09:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:11,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:11,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:11,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:11,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2025-01-10 01:09:11,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:11,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:11,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:12,077 INFO L124 PetriNetUnfolderBase]: 5235/7868 cut-off events. [2025-01-10 01:09:12,077 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 01:09:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15224 conditions, 7868 events. 5235/7868 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 59858 event pairs, 5051 based on Foata normal form. 250/4921 useless extension candidates. Maximal degree in co-relation 13055. Up to 6139 conditions per place. [2025-01-10 01:09:12,110 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 71 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-01-10 01:09:12,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 428 flow [2025-01-10 01:09:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2025-01-10 01:09:12,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68359375 [2025-01-10 01:09:12,112 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 188 flow. Second operand 4 states and 175 transitions. [2025-01-10 01:09:12,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 428 flow [2025-01-10 01:09:12,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 387 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-10 01:09:12,114 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 180 flow [2025-01-10 01:09:12,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2025-01-10 01:09:12,115 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:09:12,115 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 180 flow [2025-01-10 01:09:12,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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) [2025-01-10 01:09:12,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:12,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:12,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:09:12,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:12,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:12,117 INFO L85 PathProgramCache]: Analyzing trace with hash 381039718, now seen corresponding path program 1 times [2025-01-10 01:09:12,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:12,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-01-10 01:09:12,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:12,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:12,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:12,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:12,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-01-10 01:09:12,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293276082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:12,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:12,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:12,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187183348] [2025-01-10 01:09:12,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:12,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:12,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:12,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:12,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2025-01-10 01:09:12,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:12,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:12,481 INFO L124 PetriNetUnfolderBase]: 3563/5461 cut-off events. [2025-01-10 01:09:12,481 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-01-10 01:09:12,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11589 conditions, 5461 events. 3563/5461 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 40368 event pairs, 3430 based on Foata normal form. 0/3509 useless extension candidates. Maximal degree in co-relation 9450. Up to 4900 conditions per place. [2025-01-10 01:09:12,538 INFO L140 encePairwiseOnDemand]: 59/64 looper letters, 37 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2025-01-10 01:09:12,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 258 flow [2025-01-10 01:09:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 01:09:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 01:09:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-01-10 01:09:12,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-01-10 01:09:12,540 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 180 flow. Second operand 5 states and 156 transitions. [2025-01-10 01:09:12,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 258 flow [2025-01-10 01:09:12,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:12,541 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 179 flow [2025-01-10 01:09:12,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2025-01-10 01:09:12,542 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:09:12,542 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 179 flow [2025-01-10 01:09:12,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2025-01-10 01:09:12,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:12,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:12,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 01:09:12,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1567022521, now seen corresponding path program 1 times [2025-01-10 01:09:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:12,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274117286] [2025-01-10 01:09:12,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:12,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:12,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:12,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:12,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274117286] [2025-01-10 01:09:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274117286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:12,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:12,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:12,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285999444] [2025-01-10 01:09:12,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:12,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:12,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:12,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:12,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2025-01-10 01:09:12,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:12,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:12,790 INFO L124 PetriNetUnfolderBase]: 2315/3661 cut-off events. [2025-01-10 01:09:12,790 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2025-01-10 01:09:12,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 3661 events. 2315/3661 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 26386 event pairs, 2206 based on Foata normal form. 0/2569 useless extension candidates. Maximal degree in co-relation 6246. Up to 3202 conditions per place. [2025-01-10 01:09:12,807 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 38 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-01-10 01:09:12,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 58 transitions, 257 flow [2025-01-10 01:09:12,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-01-10 01:09:12,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078125 [2025-01-10 01:09:12,808 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 179 flow. Second operand 4 states and 130 transitions. [2025-01-10 01:09:12,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 58 transitions, 257 flow [2025-01-10 01:09:12,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 247 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:12,810 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 171 flow [2025-01-10 01:09:12,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-01-10 01:09:12,810 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -3 predicate places. [2025-01-10 01:09:12,810 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 171 flow [2025-01-10 01:09:12,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2025-01-10 01:09:12,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:12,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 01:09:12,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1567022522, now seen corresponding path program 1 times [2025-01-10 01:09:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432357442] [2025-01-10 01:09:12,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:12,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:12,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:12,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:12,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:12,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:12,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:12,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432357442] [2025-01-10 01:09:12,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432357442] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:12,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33031389] [2025-01-10 01:09:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:12,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:09:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:09:12,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:09:12,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:12,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2025-01-10 01:09:12,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:12,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:12,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:13,138 INFO L124 PetriNetUnfolderBase]: 2872/4722 cut-off events. [2025-01-10 01:09:13,139 INFO L125 PetriNetUnfolderBase]: For 447/447 co-relation queries the response was YES. [2025-01-10 01:09:13,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9935 conditions, 4722 events. 2872/4722 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 36286 event pairs, 2756 based on Foata normal form. 174/3642 useless extension candidates. Maximal degree in co-relation 6246. Up to 3214 conditions per place. [2025-01-10 01:09:13,161 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 57 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2025-01-10 01:09:13,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 79 transitions, 353 flow [2025-01-10 01:09:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:13,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 01:09:13,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-01-10 01:09:13,163 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 171 flow. Second operand 4 states and 164 transitions. [2025-01-10 01:09:13,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 79 transitions, 353 flow [2025-01-10 01:09:13,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:13,165 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 186 flow [2025-01-10 01:09:13,165 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2025-01-10 01:09:13,165 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:09:13,165 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 186 flow [2025-01-10 01:09:13,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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) [2025-01-10 01:09:13,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:13,166 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:13,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:09:13,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:13,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash 381039719, now seen corresponding path program 1 times [2025-01-10 01:09:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:13,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638014413] [2025-01-10 01:09:13,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:13,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 01:09:13,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 01:09:13,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:13,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:13,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638014413] [2025-01-10 01:09:13,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638014413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:13,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:13,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:09:13,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886832814] [2025-01-10 01:09:13,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:13,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:13,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:13,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:13,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 01:09:13,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 64 [2025-01-10 01:09:13,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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) [2025-01-10 01:09:13,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:13,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 64 [2025-01-10 01:09:13,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:13,560 INFO L124 PetriNetUnfolderBase]: 1823/3117 cut-off events. [2025-01-10 01:09:13,561 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2025-01-10 01:09:13,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6887 conditions, 3117 events. 1823/3117 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 23191 event pairs, 1742 based on Foata normal form. 0/2517 useless extension candidates. Maximal degree in co-relation 3816. Up to 2663 conditions per place. [2025-01-10 01:09:13,574 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 35 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-01-10 01:09:13,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 256 flow [2025-01-10 01:09:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-01-10 01:09:13,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-10 01:09:13,577 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 186 flow. Second operand 4 states and 128 transitions. [2025-01-10 01:09:13,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 256 flow [2025-01-10 01:09:13,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 56 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:13,578 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 182 flow [2025-01-10 01:09:13,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-10 01:09:13,579 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:09:13,580 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 182 flow [2025-01-10 01:09:13,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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) [2025-01-10 01:09:13,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:13,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:13,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 01:09:13,580 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1082599972, now seen corresponding path program 1 times [2025-01-10 01:09:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138882136] [2025-01-10 01:09:13,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:13,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:09:13,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:09:13,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:13,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138882136] [2025-01-10 01:09:13,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138882136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:09:13,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310008607] [2025-01-10 01:09:13,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:13,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:13,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:09:13,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:09:13,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 01:09:13,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:09:13,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:09:13,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:13,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:13,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:09:13,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:09:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:13,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:09:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310008607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:09:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-01-10 01:09:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30561529] [2025-01-10 01:09:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 01:09:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:13,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 01:09:13,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:09:13,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:13,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:13,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:13,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:13,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:14,001 INFO L124 PetriNetUnfolderBase]: 1197/2177 cut-off events. [2025-01-10 01:09:14,001 INFO L125 PetriNetUnfolderBase]: For 460/460 co-relation queries the response was YES. [2025-01-10 01:09:14,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4602 conditions, 2177 events. 1197/2177 cut-off events. For 460/460 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 15995 event pairs, 1132 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 3206. Up to 1782 conditions per place. [2025-01-10 01:09:14,010 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 32 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-01-10 01:09:14,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 248 flow [2025-01-10 01:09:14,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:09:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 01:09:14,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-01-10 01:09:14,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2025-01-10 01:09:14,012 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 182 flow. Second operand 4 states and 134 transitions. [2025-01-10 01:09:14,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 248 flow [2025-01-10 01:09:14,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:14,013 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 179 flow [2025-01-10 01:09:14,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-01-10 01:09:14,013 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -2 predicate places. [2025-01-10 01:09:14,013 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 179 flow [2025-01-10 01:09:14,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:14,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:14,014 INFO L206 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] [2025-01-10 01:09:14,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:09:14,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:09:14,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:14,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash 946504331, now seen corresponding path program 1 times [2025-01-10 01:09:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:14,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454173738] [2025-01-10 01:09:14,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:14,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-10 01:09:14,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-10 01:09:14,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:09:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454173738] [2025-01-10 01:09:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454173738] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272693125] [2025-01-10 01:09:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:14,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:14,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:14,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:14,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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) [2025-01-10 01:09:14,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:14,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:14,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:14,468 INFO L124 PetriNetUnfolderBase]: 1844/3351 cut-off events. [2025-01-10 01:09:14,468 INFO L125 PetriNetUnfolderBase]: For 825/825 co-relation queries the response was YES. [2025-01-10 01:09:14,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7007 conditions, 3351 events. 1844/3351 cut-off events. For 825/825 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 23908 event pairs, 670 based on Foata normal form. 4/3125 useless extension candidates. Maximal degree in co-relation 5241. Up to 1537 conditions per place. [2025-01-10 01:09:14,481 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 48 selfloop transitions, 3 changer transitions 1/69 dead transitions. [2025-01-10 01:09:14,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 326 flow [2025-01-10 01:09:14,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-01-10 01:09:14,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-01-10 01:09:14,483 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 179 flow. Second operand 3 states and 122 transitions. [2025-01-10 01:09:14,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 326 flow [2025-01-10 01:09:14,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 01:09:14,484 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 194 flow [2025-01-10 01:09:14,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-10 01:09:14,485 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, -1 predicate places. [2025-01-10 01:09:14,485 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 194 flow [2025-01-10 01:09:14,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 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) [2025-01-10 01:09:14,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:14,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:14,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 01:09:14,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:14,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1435275457, now seen corresponding path program 1 times [2025-01-10 01:09:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681125002] [2025-01-10 01:09:14,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:09:14,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:09:14,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:14,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:09:14,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:14,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681125002] [2025-01-10 01:09:14,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681125002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012532268] [2025-01-10 01:09:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:14,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:14,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:14,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:14,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2025-01-10 01:09:14,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:14,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:14,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:14,875 INFO L124 PetriNetUnfolderBase]: 2104/3681 cut-off events. [2025-01-10 01:09:14,875 INFO L125 PetriNetUnfolderBase]: For 1962/1962 co-relation queries the response was YES. [2025-01-10 01:09:14,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8439 conditions, 3681 events. 2104/3681 cut-off events. For 1962/1962 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 25626 event pairs, 929 based on Foata normal form. 41/3494 useless extension candidates. Maximal degree in co-relation 6420. Up to 1512 conditions per place. [2025-01-10 01:09:14,892 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 55 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-01-10 01:09:14,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 365 flow [2025-01-10 01:09:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:14,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:14,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-10 01:09:14,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-01-10 01:09:14,893 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 194 flow. Second operand 3 states and 124 transitions. [2025-01-10 01:09:14,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 365 flow [2025-01-10 01:09:14,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:14,895 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 207 flow [2025-01-10 01:09:14,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-01-10 01:09:14,896 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 1 predicate places. [2025-01-10 01:09:14,896 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 207 flow [2025-01-10 01:09:14,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2025-01-10 01:09:14,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:14,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:14,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:09:14,896 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:14,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:14,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1287336735, now seen corresponding path program 1 times [2025-01-10 01:09:14,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177706414] [2025-01-10 01:09:14,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-10 01:09:14,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-10 01:09:14,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:14,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:14,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:14,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177706414] [2025-01-10 01:09:14,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177706414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:14,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:14,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:09:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717400885] [2025-01-10 01:09:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:14,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:09:14,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:14,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:09:14,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:09:14,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 64 [2025-01-10 01:09:14,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2025-01-10 01:09:14,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:14,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 64 [2025-01-10 01:09:14,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:15,223 INFO L124 PetriNetUnfolderBase]: 2350/4015 cut-off events. [2025-01-10 01:09:15,223 INFO L125 PetriNetUnfolderBase]: For 3022/3022 co-relation queries the response was YES. [2025-01-10 01:09:15,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 4015 events. 2350/4015 cut-off events. For 3022/3022 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 26895 event pairs, 949 based on Foata normal form. 76/3861 useless extension candidates. Maximal degree in co-relation 7425. Up to 1821 conditions per place. [2025-01-10 01:09:15,237 INFO L140 encePairwiseOnDemand]: 61/64 looper letters, 59 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-01-10 01:09:15,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 403 flow [2025-01-10 01:09:15,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:09:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 01:09:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 01:09:15,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-01-10 01:09:15,238 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 207 flow. Second operand 3 states and 126 transitions. [2025-01-10 01:09:15,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 403 flow [2025-01-10 01:09:15,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 388 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:15,240 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 215 flow [2025-01-10 01:09:15,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-01-10 01:09:15,240 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2025-01-10 01:09:15,241 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 215 flow [2025-01-10 01:09:15,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2025-01-10 01:09:15,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:15,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:15,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:09:15,241 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:15,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:15,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1047368195, now seen corresponding path program 1 times [2025-01-10 01:09:15,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:15,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149089434] [2025-01-10 01:09:15,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:09:15,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:15,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:09:15,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:15,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:15,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:15,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:15,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149089434] [2025-01-10 01:09:15,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149089434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:15,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:15,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:15,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492346384] [2025-01-10 01:09:15,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:15,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:15,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:15,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:15,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:15,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:15,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:15,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:15,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:15,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:16,216 INFO L124 PetriNetUnfolderBase]: 7240/11225 cut-off events. [2025-01-10 01:09:16,217 INFO L125 PetriNetUnfolderBase]: For 7269/7329 co-relation queries the response was YES. [2025-01-10 01:09:16,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26981 conditions, 11225 events. 7240/11225 cut-off events. For 7269/7329 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 75820 event pairs, 1251 based on Foata normal form. 292/10748 useless extension candidates. Maximal degree in co-relation 21583. Up to 7181 conditions per place. [2025-01-10 01:09:16,260 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 100 selfloop transitions, 11 changer transitions 3/126 dead transitions. [2025-01-10 01:09:16,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 126 transitions, 643 flow [2025-01-10 01:09:16,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:09:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 01:09:16,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 249 transitions. [2025-01-10 01:09:16,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5558035714285714 [2025-01-10 01:09:16,261 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 215 flow. Second operand 7 states and 249 transitions. [2025-01-10 01:09:16,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 126 transitions, 643 flow [2025-01-10 01:09:16,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 126 transitions, 627 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 01:09:16,265 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 306 flow [2025-01-10 01:09:16,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2025-01-10 01:09:16,266 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2025-01-10 01:09:16,266 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 306 flow [2025-01-10 01:09:16,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:16,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:16,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:16,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:09:16,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:16,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash 941349007, now seen corresponding path program 2 times [2025-01-10 01:09:16,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:16,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808770548] [2025-01-10 01:09:16,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:16,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:16,275 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:09:16,291 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:16,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:16,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808770548] [2025-01-10 01:09:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808770548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27088550] [2025-01-10 01:09:16,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:16,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:16,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:16,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:16,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:16,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:16,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:16,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:16,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:17,271 INFO L124 PetriNetUnfolderBase]: 7580/11895 cut-off events. [2025-01-10 01:09:17,271 INFO L125 PetriNetUnfolderBase]: For 10719/10803 co-relation queries the response was YES. [2025-01-10 01:09:17,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31653 conditions, 11895 events. 7580/11895 cut-off events. For 10719/10803 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 82557 event pairs, 1239 based on Foata normal form. 108/11818 useless extension candidates. Maximal degree in co-relation 24671. Up to 4611 conditions per place. [2025-01-10 01:09:17,330 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 112 selfloop transitions, 11 changer transitions 1/136 dead transitions. [2025-01-10 01:09:17,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 136 transitions, 790 flow [2025-01-10 01:09:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:09:17,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 01:09:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 222 transitions. [2025-01-10 01:09:17,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578125 [2025-01-10 01:09:17,332 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 306 flow. Second operand 6 states and 222 transitions. [2025-01-10 01:09:17,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 136 transitions, 790 flow [2025-01-10 01:09:17,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 136 transitions, 790 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:17,355 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 358 flow [2025-01-10 01:09:17,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2025-01-10 01:09:17,356 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 21 predicate places. [2025-01-10 01:09:17,356 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 358 flow [2025-01-10 01:09:17,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:17,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:17,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:09:17,356 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -342620257, now seen corresponding path program 3 times [2025-01-10 01:09:17,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883732408] [2025-01-10 01:09:17,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 01:09:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:17,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 3 equivalence classes. [2025-01-10 01:09:17,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 36 of 37 statements. [2025-01-10 01:09:17,383 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-10 01:09:17,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:17,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:17,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883732408] [2025-01-10 01:09:17,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883732408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:17,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:17,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:17,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283700381] [2025-01-10 01:09:17,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:17,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:17,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:17,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:17,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:17,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:17,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:17,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:17,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:17,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:18,611 INFO L124 PetriNetUnfolderBase]: 8522/13520 cut-off events. [2025-01-10 01:09:18,611 INFO L125 PetriNetUnfolderBase]: For 26492/27172 co-relation queries the response was YES. [2025-01-10 01:09:18,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41456 conditions, 13520 events. 8522/13520 cut-off events. For 26492/27172 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 98644 event pairs, 838 based on Foata normal form. 1054/14368 useless extension candidates. Maximal degree in co-relation 33837. Up to 4406 conditions per place. [2025-01-10 01:09:18,697 INFO L140 encePairwiseOnDemand]: 55/64 looper letters, 123 selfloop transitions, 29 changer transitions 9/174 dead transitions. [2025-01-10 01:09:18,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 174 transitions, 1137 flow [2025-01-10 01:09:18,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:18,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:18,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 320 transitions. [2025-01-10 01:09:18,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-01-10 01:09:18,698 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 358 flow. Second operand 9 states and 320 transitions. [2025-01-10 01:09:18,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 174 transitions, 1137 flow [2025-01-10 01:09:18,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 174 transitions, 1094 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:18,924 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 573 flow [2025-01-10 01:09:18,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=573, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2025-01-10 01:09:18,925 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 31 predicate places. [2025-01-10 01:09:18,925 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 573 flow [2025-01-10 01:09:18,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:18,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:18,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:18,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 01:09:18,926 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:18,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash 514276903, now seen corresponding path program 4 times [2025-01-10 01:09:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830978175] [2025-01-10 01:09:18,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 01:09:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:18,935 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:09:18,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:18,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 01:09:18,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 01:09:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830978175] [2025-01-10 01:09:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830978175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:19,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:19,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451995242] [2025-01-10 01:09:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:19,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:19,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:19,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:19,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:19,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 573 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:19,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:19,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:20,898 INFO L124 PetriNetUnfolderBase]: 14361/22539 cut-off events. [2025-01-10 01:09:20,899 INFO L125 PetriNetUnfolderBase]: For 55213/55931 co-relation queries the response was YES. [2025-01-10 01:09:20,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76387 conditions, 22539 events. 14361/22539 cut-off events. For 55213/55931 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 173762 event pairs, 2107 based on Foata normal form. 684/22603 useless extension candidates. Maximal degree in co-relation 63645. Up to 6307 conditions per place. [2025-01-10 01:09:21,046 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 158 selfloop transitions, 53 changer transitions 2/228 dead transitions. [2025-01-10 01:09:21,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 228 transitions, 1744 flow [2025-01-10 01:09:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 01:09:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 01:09:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 362 transitions. [2025-01-10 01:09:21,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.565625 [2025-01-10 01:09:21,048 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 573 flow. Second operand 10 states and 362 transitions. [2025-01-10 01:09:21,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 228 transitions, 1744 flow [2025-01-10 01:09:21,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 228 transitions, 1716 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 01:09:21,229 INFO L231 Difference]: Finished difference. Result has 108 places, 118 transitions, 1026 flow [2025-01-10 01:09:21,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1026, PETRI_PLACES=108, PETRI_TRANSITIONS=118} [2025-01-10 01:09:21,230 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 42 predicate places. [2025-01-10 01:09:21,230 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 1026 flow [2025-01-10 01:09:21,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:21,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:21,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:21,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 01:09:21,230 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:21,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash 7178729, now seen corresponding path program 5 times [2025-01-10 01:09:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59219984] [2025-01-10 01:09:21,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 01:09:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:21,240 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 3 equivalence classes. [2025-01-10 01:09:21,250 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:21,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-10 01:09:21,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:21,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59219984] [2025-01-10 01:09:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59219984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:09:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880563461] [2025-01-10 01:09:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:21,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:09:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:21,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:09:21,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:09:21,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-01-10 01:09:21,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 118 transitions, 1026 flow. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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) [2025-01-10 01:09:21,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:21,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-01-10 01:09:21,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:24,812 INFO L124 PetriNetUnfolderBase]: 23969/36046 cut-off events. [2025-01-10 01:09:24,812 INFO L125 PetriNetUnfolderBase]: For 123731/125405 co-relation queries the response was YES. [2025-01-10 01:09:24,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133329 conditions, 36046 events. 23969/36046 cut-off events. For 123731/125405 co-relation queries the response was YES. Maximal size of possible extension queue 2185. Compared 276830 event pairs, 4374 based on Foata normal form. 1302/36666 useless extension candidates. Maximal degree in co-relation 114403. Up to 22178 conditions per place. [2025-01-10 01:09:25,050 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 179 selfloop transitions, 55 changer transitions 8/256 dead transitions. [2025-01-10 01:09:25,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 256 transitions, 2383 flow [2025-01-10 01:09:25,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 01:09:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 01:09:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2025-01-10 01:09:25,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2025-01-10 01:09:25,052 INFO L175 Difference]: Start difference. First operand has 108 places, 118 transitions, 1026 flow. Second operand 9 states and 327 transitions. [2025-01-10 01:09:25,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 256 transitions, 2383 flow [2025-01-10 01:09:25,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 256 transitions, 2363 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:25,869 INFO L231 Difference]: Finished difference. Result has 123 places, 157 transitions, 1751 flow [2025-01-10 01:09:25,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1751, PETRI_PLACES=123, PETRI_TRANSITIONS=157} [2025-01-10 01:09:25,869 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 57 predicate places. [2025-01-10 01:09:25,869 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 157 transitions, 1751 flow [2025-01-10 01:09:25,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 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) [2025-01-10 01:09:25,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:25,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:25,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 01:09:25,870 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:25,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1159177531, now seen corresponding path program 6 times [2025-01-10 01:09:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938044638] [2025-01-10 01:09:25,870 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-10 01:09:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:25,877 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 3 equivalence classes. [2025-01-10 01:09:25,898 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:25,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-01-10 01:09:25,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:26,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:26,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:26,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938044638] [2025-01-10 01:09:26,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938044638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:26,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:26,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:26,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426434936] [2025-01-10 01:09:26,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:26,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:26,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:26,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:26,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 157 transitions, 1751 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:26,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:26,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:26,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:31,849 INFO L124 PetriNetUnfolderBase]: 34422/54082 cut-off events. [2025-01-10 01:09:31,849 INFO L125 PetriNetUnfolderBase]: For 232857/234574 co-relation queries the response was YES. [2025-01-10 01:09:32,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211325 conditions, 54082 events. 34422/54082 cut-off events. For 232857/234574 co-relation queries the response was YES. Maximal size of possible extension queue 3619. Compared 476673 event pairs, 4462 based on Foata normal form. 2282/55410 useless extension candidates. Maximal degree in co-relation 181870. Up to 12107 conditions per place. [2025-01-10 01:09:32,363 INFO L140 encePairwiseOnDemand]: 53/64 looper letters, 187 selfloop transitions, 184 changer transitions 5/402 dead transitions. [2025-01-10 01:09:32,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 402 transitions, 4604 flow [2025-01-10 01:09:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 01:09:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 01:09:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 434 transitions. [2025-01-10 01:09:32,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5651041666666666 [2025-01-10 01:09:32,365 INFO L175 Difference]: Start difference. First operand has 123 places, 157 transitions, 1751 flow. Second operand 12 states and 434 transitions. [2025-01-10 01:09:32,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 402 transitions, 4604 flow [2025-01-10 01:09:34,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 402 transitions, 4566 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:34,589 INFO L231 Difference]: Finished difference. Result has 143 places, 273 transitions, 3961 flow [2025-01-10 01:09:34,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3961, PETRI_PLACES=143, PETRI_TRANSITIONS=273} [2025-01-10 01:09:34,590 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 77 predicate places. [2025-01-10 01:09:34,590 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 273 transitions, 3961 flow [2025-01-10 01:09:34,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:34,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:34,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:34,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 01:09:34,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:34,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2054262127, now seen corresponding path program 7 times [2025-01-10 01:09:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:34,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361571358] [2025-01-10 01:09:34,592 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-10 01:09:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:34,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 01:09:34,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:34,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:09:34,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:34,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361571358] [2025-01-10 01:09:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361571358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:34,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 01:09:34,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028715302] [2025-01-10 01:09:34,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:34,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 01:09:34,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:34,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 01:09:34,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 01:09:35,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:35,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 273 transitions, 3961 flow. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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) [2025-01-10 01:09:35,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:35,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:35,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 01:09:42,618 INFO L124 PetriNetUnfolderBase]: 38556/61317 cut-off events. [2025-01-10 01:09:42,618 INFO L125 PetriNetUnfolderBase]: For 442136/444744 co-relation queries the response was YES. [2025-01-10 01:09:43,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281216 conditions, 61317 events. 38556/61317 cut-off events. For 442136/444744 co-relation queries the response was YES. Maximal size of possible extension queue 4147. Compared 558683 event pairs, 8447 based on Foata normal form. 2108/62183 useless extension candidates. Maximal degree in co-relation 240545. Up to 38420 conditions per place. [2025-01-10 01:09:43,443 INFO L140 encePairwiseOnDemand]: 54/64 looper letters, 307 selfloop transitions, 120 changer transitions 23/476 dead transitions. [2025-01-10 01:09:43,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 476 transitions, 6793 flow [2025-01-10 01:09:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 01:09:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 01:09:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 439 transitions. [2025-01-10 01:09:43,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5276442307692307 [2025-01-10 01:09:43,444 INFO L175 Difference]: Start difference. First operand has 143 places, 273 transitions, 3961 flow. Second operand 13 states and 439 transitions. [2025-01-10 01:09:43,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 476 transitions, 6793 flow [2025-01-10 01:09:49,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 476 transitions, 6721 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-01-10 01:09:49,675 INFO L231 Difference]: Finished difference. Result has 166 places, 349 transitions, 5594 flow [2025-01-10 01:09:49,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=3897, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5594, PETRI_PLACES=166, PETRI_TRANSITIONS=349} [2025-01-10 01:09:49,676 INFO L279 CegarLoopForPetriNet]: 66 programPoint places, 100 predicate places. [2025-01-10 01:09:49,676 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 349 transitions, 5594 flow [2025-01-10 01:09:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 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) [2025-01-10 01:09:49,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 01:09:49,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:09:49,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 01:09:49,676 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-01-10 01:09:49,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:09:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1912722985, now seen corresponding path program 8 times [2025-01-10 01:09:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:09:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131440101] [2025-01-10 01:09:49,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:09:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:09:49,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-10 01:09:49,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 01:09:49,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:09:49,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:09:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:09:49,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:09:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131440101] [2025-01-10 01:09:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131440101] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:09:49,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:09:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 01:09:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503141409] [2025-01-10 01:09:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:09:49,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:09:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:09:49,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:09:49,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:09:49,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 64 [2025-01-10 01:09:49,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 349 transitions, 5594 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:09:49,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 01:09:49,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 64 [2025-01-10 01:09:49,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand