./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:43:02,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:43:02,638 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:43:02,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:43:02,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:43:02,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:43:02,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:43:02,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:43:02,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:43:02,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:43:02,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:43:02,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:43:02,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:43:02,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:43:02,682 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:43:02,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:43:02,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:43:02,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:43:02,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:43:02,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:02,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:02,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:43:02,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:43:02,685 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:43:02,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:43:02,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:02,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:43:02,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:43:02,686 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 ! call(reach_error())) ) 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2025-01-09 16:43:03,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:43:03,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:43:03,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:43:03,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:43:03,015 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:43:03,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-01-09 16:43:04,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5e5a62e3/a424984c364f4c13a5559d6a6f77d49d/FLAGc32245c51 [2025-01-09 16:43:04,674 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:43:04,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-01-09 16:43:04,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5e5a62e3/a424984c364f4c13a5559d6a6f77d49d/FLAGc32245c51 [2025-01-09 16:43:04,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f5e5a62e3/a424984c364f4c13a5559d6a6f77d49d [2025-01-09 16:43:04,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:43:04,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:43:04,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:04,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:43:04,753 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:43:04,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:04" (1/1) ... [2025-01-09 16:43:04,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6f5d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:04, skipping insertion in model container [2025-01-09 16:43:04,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:43:04" (1/1) ... [2025-01-09 16:43:04,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:43:04,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-01-09 16:43:04,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:04,965 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:43:04,982 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-01-09 16:43:04,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:43:05,000 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:43:05,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05 WrapperNode [2025-01-09 16:43:05,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:43:05,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:05,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:43:05,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:43:05,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,032 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-01-09 16:43:05,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:43:05,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:43:05,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:43:05,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:43:05,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,063 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:43:05,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,072 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:43:05,085 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:43:05,085 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:43:05,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:43:05,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (1/1) ... [2025-01-09 16:43:05,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:43:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:05,123 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-09 16:43:05,129 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-09 16:43:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:43:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:43:05,150 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:43:05,150 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:43:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:43:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:43:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:43:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:43:05,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:43:05,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:43:05,153 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:43:05,242 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:43:05,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:43:05,435 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:43:05,435 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:43:05,613 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:43:05,613 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:43:05,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:05 BoogieIcfgContainer [2025-01-09 16:43:05,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:43:05,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:43:05,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:43:05,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:43:05,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:43:04" (1/3) ... [2025-01-09 16:43:05,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c1c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:05, skipping insertion in model container [2025-01-09 16:43:05,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:43:05" (2/3) ... [2025-01-09 16:43:05,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35c1c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:43:05, skipping insertion in model container [2025-01-09 16:43:05,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:43:05" (3/3) ... [2025-01-09 16:43:05,629 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-01-09 16:43:05,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:43:05,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:43:05,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:43:05,711 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:43:05,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 64 flow [2025-01-09 16:43:05,783 INFO L124 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-01-09 16:43:05,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:43:05,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-01-09 16:43:05,792 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 64 flow [2025-01-09 16:43:05,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 22 transitions, 56 flow [2025-01-09 16:43:05,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:43:05,822 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=LoopHeads, 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;@525cd8d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:43:05,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:43:05,839 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:43:05,840 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-01-09 16:43:05,840 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:43:05,840 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:05,844 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:05,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1395666523, now seen corresponding path program 1 times [2025-01-09 16:43:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695067554] [2025-01-09 16:43:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:05,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:05,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 16:43:05,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 16:43:05,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:05,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:06,417 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-09 16:43:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695067554] [2025-01-09 16:43:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695067554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:43:06,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974140090] [2025-01-09 16:43:06,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:43:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:06,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:43:06,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:43:06,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2025-01-09 16:43:06,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 16:43:06,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:06,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2025-01-09 16:43:06,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:06,652 INFO L124 PetriNetUnfolderBase]: 104/216 cut-off events. [2025-01-09 16:43:06,652 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 16:43:06,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 216 events. 104/216 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 857 event pairs, 8 based on Foata normal form. 12/224 useless extension candidates. Maximal degree in co-relation 376. Up to 117 conditions per place. [2025-01-09 16:43:06,656 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 29 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2025-01-09 16:43:06,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 42 transitions, 175 flow [2025-01-09 16:43:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-01-09 16:43:06,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.656 [2025-01-09 16:43:06,671 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 56 flow. Second operand 5 states and 82 transitions. [2025-01-09 16:43:06,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 42 transitions, 175 flow [2025-01-09 16:43:06,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:43:06,680 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2025-01-09 16:43:06,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-01-09 16:43:06,687 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 3 predicate places. [2025-01-09 16:43:06,687 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2025-01-09 16:43:06,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 16:43:06,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:06,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:06,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:43:06,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:06,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:06,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1033262518, now seen corresponding path program 1 times [2025-01-09 16:43:06,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:06,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577101218] [2025-01-09 16:43:06,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:06,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:06,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:43:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:43:06,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:06,948 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-09 16:43:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577101218] [2025-01-09 16:43:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577101218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:06,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:06,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:43:06,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972495714] [2025-01-09 16:43:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:06,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:43:06,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:06,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:43:06,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:43:06,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2025-01-09 16:43:06,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 16:43:06,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:06,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2025-01-09 16:43:06,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:07,090 INFO L124 PetriNetUnfolderBase]: 116/238 cut-off events. [2025-01-09 16:43:07,091 INFO L125 PetriNetUnfolderBase]: For 194/203 co-relation queries the response was YES. [2025-01-09 16:43:07,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 238 events. 116/238 cut-off events. For 194/203 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1032 event pairs, 11 based on Foata normal form. 18/243 useless extension candidates. Maximal degree in co-relation 234. Up to 124 conditions per place. [2025-01-09 16:43:07,095 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 26 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2025-01-09 16:43:07,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 195 flow [2025-01-09 16:43:07,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:43:07,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:43:07,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-01-09 16:43:07,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-01-09 16:43:07,098 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 4 states and 62 transitions. [2025-01-09 16:43:07,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 195 flow [2025-01-09 16:43:07,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:07,101 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2025-01-09 16:43:07,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-01-09 16:43:07,102 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-01-09 16:43:07,102 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2025-01-09 16:43:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-09 16:43:07,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:07,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:43:07,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:07,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -660956378, now seen corresponding path program 1 times [2025-01-09 16:43:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:07,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796103801] [2025-01-09 16:43:07,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:07,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:43:07,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:43:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:07,328 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-09 16:43:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:07,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796103801] [2025-01-09 16:43:07,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796103801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:07,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:07,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:43:07,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678209996] [2025-01-09 16:43:07,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:07,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:43:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:07,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:43:07,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:43:07,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2025-01-09 16:43:07,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-09 16:43:07,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:07,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2025-01-09 16:43:07,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:07,493 INFO L124 PetriNetUnfolderBase]: 116/241 cut-off events. [2025-01-09 16:43:07,493 INFO L125 PetriNetUnfolderBase]: For 180/207 co-relation queries the response was YES. [2025-01-09 16:43:07,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 241 events. 116/241 cut-off events. For 180/207 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 987 event pairs, 15 based on Foata normal form. 23/260 useless extension candidates. Maximal degree in co-relation 298. Up to 83 conditions per place. [2025-01-09 16:43:07,496 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 30 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2025-01-09 16:43:07,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 238 flow [2025-01-09 16:43:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:43:07,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:43:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-01-09 16:43:07,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632 [2025-01-09 16:43:07,498 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 5 states and 79 transitions. [2025-01-09 16:43:07,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 238 flow [2025-01-09 16:43:07,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:07,501 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 150 flow [2025-01-09 16:43:07,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-01-09 16:43:07,502 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2025-01-09 16:43:07,502 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 150 flow [2025-01-09 16:43:07,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-09 16:43:07,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:07,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:07,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:43:07,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:07,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1812994558, now seen corresponding path program 2 times [2025-01-09 16:43:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038663298] [2025-01-09 16:43:07,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:07,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:07,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:43:07,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:43:07,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:43:07,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:08,263 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-09 16:43:08,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:08,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038663298] [2025-01-09 16:43:08,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038663298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:08,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:08,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:43:08,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933646298] [2025-01-09 16:43:08,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:08,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:43:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:08,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:43:08,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:43:08,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-01-09 16:43:08,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 16:43:08,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:08,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-01-09 16:43:08,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:08,899 INFO L124 PetriNetUnfolderBase]: 247/474 cut-off events. [2025-01-09 16:43:08,899 INFO L125 PetriNetUnfolderBase]: For 603/603 co-relation queries the response was YES. [2025-01-09 16:43:08,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 474 events. 247/474 cut-off events. For 603/603 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1993 event pairs, 17 based on Foata normal form. 2/475 useless extension candidates. Maximal degree in co-relation 567. Up to 262 conditions per place. [2025-01-09 16:43:08,904 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 41 selfloop transitions, 22 changer transitions 16/84 dead transitions. [2025-01-09 16:43:08,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 84 transitions, 516 flow [2025-01-09 16:43:08,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:43:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:43:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 182 transitions. [2025-01-09 16:43:08,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48533333333333334 [2025-01-09 16:43:08,906 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 150 flow. Second operand 15 states and 182 transitions. [2025-01-09 16:43:08,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 84 transitions, 516 flow [2025-01-09 16:43:08,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 512 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:08,914 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 316 flow [2025-01-09 16:43:08,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2025-01-09 16:43:08,916 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 32 predicate places. [2025-01-09 16:43:08,916 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 316 flow [2025-01-09 16:43:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-09 16:43:08,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:08,916 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] [2025-01-09 16:43:08,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:43:08,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1081706049, now seen corresponding path program 1 times [2025-01-09 16:43:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541393075] [2025-01-09 16:43:08,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:43:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:43:08,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:08,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:43:08,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:09,157 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-09 16:43:09,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:09,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541393075] [2025-01-09 16:43:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541393075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:43:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895193112] [2025-01-09 16:43:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:43:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:43:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:43:09,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 25 [2025-01-09 16:43:09,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-09 16:43:09,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:09,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 25 [2025-01-09 16:43:09,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:09,433 INFO L124 PetriNetUnfolderBase]: 407/848 cut-off events. [2025-01-09 16:43:09,433 INFO L125 PetriNetUnfolderBase]: For 2807/2817 co-relation queries the response was YES. [2025-01-09 16:43:09,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3146 conditions, 848 events. 407/848 cut-off events. For 2807/2817 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4374 event pairs, 35 based on Foata normal form. 16/852 useless extension candidates. Maximal degree in co-relation 2359. Up to 228 conditions per place. [2025-01-09 16:43:09,448 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 64 selfloop transitions, 32 changer transitions 0/107 dead transitions. [2025-01-09 16:43:09,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 107 transitions, 871 flow [2025-01-09 16:43:09,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:43:09,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:43:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2025-01-09 16:43:09,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7085714285714285 [2025-01-09 16:43:09,451 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 316 flow. Second operand 7 states and 124 transitions. [2025-01-09 16:43:09,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 107 transitions, 871 flow [2025-01-09 16:43:09,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 790 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-01-09 16:43:09,472 INFO L231 Difference]: Finished difference. Result has 61 places, 69 transitions, 545 flow [2025-01-09 16:43:09,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2025-01-09 16:43:09,476 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2025-01-09 16:43:09,476 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 545 flow [2025-01-09 16:43:09,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-09 16:43:09,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:09,477 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] [2025-01-09 16:43:09,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:43:09,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1872316947, now seen corresponding path program 2 times [2025-01-09 16:43:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735627928] [2025-01-09 16:43:09,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:43:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:09,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:43:09,509 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:09,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:43:09,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:10,330 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-09 16:43:10,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:10,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735627928] [2025-01-09 16:43:10,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735627928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:10,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:10,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:43:10,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180800713] [2025-01-09 16:43:10,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:10,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:43:10,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:10,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:43:10,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:43:10,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-01-09 16:43:10,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 545 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-09 16:43:10,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:10,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-01-09 16:43:10,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:19,085 INFO L124 PetriNetUnfolderBase]: 646/1240 cut-off events. [2025-01-09 16:43:19,086 INFO L125 PetriNetUnfolderBase]: For 6078/6078 co-relation queries the response was YES. [2025-01-09 16:43:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5315 conditions, 1240 events. 646/1240 cut-off events. For 6078/6078 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6320 event pairs, 51 based on Foata normal form. 5/1244 useless extension candidates. Maximal degree in co-relation 3866. Up to 778 conditions per place. [2025-01-09 16:43:19,099 INFO L140 encePairwiseOnDemand]: 14/25 looper letters, 63 selfloop transitions, 52 changer transitions 20/140 dead transitions. [2025-01-09 16:43:19,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 140 transitions, 1322 flow [2025-01-09 16:43:19,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:43:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:43:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 224 transitions. [2025-01-09 16:43:19,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47157894736842104 [2025-01-09 16:43:19,101 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 545 flow. Second operand 19 states and 224 transitions. [2025-01-09 16:43:19,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 140 transitions, 1322 flow [2025-01-09 16:43:19,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 140 transitions, 1260 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-01-09 16:43:19,120 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 937 flow [2025-01-09 16:43:19,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=937, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-01-09 16:43:19,122 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 61 predicate places. [2025-01-09 16:43:19,122 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 937 flow [2025-01-09 16:43:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-09 16:43:19,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:19,123 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] [2025-01-09 16:43:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:43:19,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:19,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:19,124 INFO L85 PathProgramCache]: Analyzing trace with hash 746958629, now seen corresponding path program 3 times [2025-01-09 16:43:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894952375] [2025-01-09 16:43:19,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:19,131 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-01-09 16:43:19,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:19,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:19,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894952375] [2025-01-09 16:43:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894952375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481390997] [2025-01-09 16:43:19,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:19,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:19,765 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-09 16:43:19,768 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-09 16:43:19,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-01-09 16:43:19,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:43:19,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:19,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:19,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:43:19,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:20,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481390997] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:21,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-01-09 16:43:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881523289] [2025-01-09 16:43:21,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:21,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:43:21,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:21,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:43:21,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:43:21,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-01-09 16:43:21,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 937 flow. Second operand has 26 states, 26 states have (on average 8.076923076923077) internal successors, (210), 26 states have internal predecessors, (210), 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-09 16:43:21,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:21,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-01-09 16:43:21,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:27,900 INFO L124 PetriNetUnfolderBase]: 1880/3509 cut-off events. [2025-01-09 16:43:27,901 INFO L125 PetriNetUnfolderBase]: For 22352/22356 co-relation queries the response was YES. [2025-01-09 16:43:27,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16369 conditions, 3509 events. 1880/3509 cut-off events. For 22352/22356 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22364 event pairs, 41 based on Foata normal form. 23/3531 useless extension candidates. Maximal degree in co-relation 15164. Up to 920 conditions per place. [2025-01-09 16:43:27,926 INFO L140 encePairwiseOnDemand]: 13/25 looper letters, 197 selfloop transitions, 162 changer transitions 102/465 dead transitions. [2025-01-09 16:43:27,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 465 transitions, 4780 flow [2025-01-09 16:43:27,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 16:43:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-01-09 16:43:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 746 transitions. [2025-01-09 16:43:27,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47365079365079366 [2025-01-09 16:43:27,930 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 937 flow. Second operand 63 states and 746 transitions. [2025-01-09 16:43:27,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 465 transitions, 4780 flow [2025-01-09 16:43:27,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 465 transitions, 4493 flow, removed 126 selfloop flow, removed 10 redundant places. [2025-01-09 16:43:27,979 INFO L231 Difference]: Finished difference. Result has 164 places, 215 transitions, 2534 flow [2025-01-09 16:43:27,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=2534, PETRI_PLACES=164, PETRI_TRANSITIONS=215} [2025-01-09 16:43:27,980 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 137 predicate places. [2025-01-09 16:43:27,980 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 215 transitions, 2534 flow [2025-01-09 16:43:27,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 8.076923076923077) internal successors, (210), 26 states have internal predecessors, (210), 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-09 16:43:27,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:27,981 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:27,988 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-09 16:43:28,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:28,185 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:28,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1144441355, now seen corresponding path program 3 times [2025-01-09 16:43:28,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:28,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055976543] [2025-01-09 16:43:28,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:28,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:28,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:43:28,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:28,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:28,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055976543] [2025-01-09 16:43:28,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055976543] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:28,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055825403] [2025-01-09 16:43:28,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:43:28,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:28,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:28,837 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-09 16:43:28,838 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-09 16:43:28,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:43:28,909 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:28,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:43:28,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:28,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 16:43:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:29,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:29,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055825403] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:29,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:29,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-01-09 16:43:29,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916205350] [2025-01-09 16:43:29,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:29,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:43:29,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:29,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:43:29,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:43:29,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-01-09 16:43:29,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 215 transitions, 2534 flow. Second operand has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:29,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:29,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-01-09 16:43:29,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:33,146 INFO L124 PetriNetUnfolderBase]: 3074/5689 cut-off events. [2025-01-09 16:43:33,146 INFO L125 PetriNetUnfolderBase]: For 58322/58330 co-relation queries the response was YES. [2025-01-09 16:43:33,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31999 conditions, 5689 events. 3074/5689 cut-off events. For 58322/58330 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 38898 event pairs, 97 based on Foata normal form. 18/5706 useless extension candidates. Maximal degree in co-relation 31681. Up to 1066 conditions per place. [2025-01-09 16:43:33,257 INFO L140 encePairwiseOnDemand]: 14/25 looper letters, 252 selfloop transitions, 340 changer transitions 43/639 dead transitions. [2025-01-09 16:43:33,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 639 transitions, 8471 flow [2025-01-09 16:43:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-01-09 16:43:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-01-09 16:43:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 593 transitions. [2025-01-09 16:43:33,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046808510638298 [2025-01-09 16:43:33,261 INFO L175 Difference]: Start difference. First operand has 164 places, 215 transitions, 2534 flow. Second operand 47 states and 593 transitions. [2025-01-09 16:43:33,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 639 transitions, 8471 flow [2025-01-09 16:43:33,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 639 transitions, 7410 flow, removed 508 selfloop flow, removed 20 redundant places. [2025-01-09 16:43:33,442 INFO L231 Difference]: Finished difference. Result has 202 places, 419 transitions, 5647 flow [2025-01-09 16:43:33,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=5647, PETRI_PLACES=202, PETRI_TRANSITIONS=419} [2025-01-09 16:43:33,444 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 175 predicate places. [2025-01-09 16:43:33,445 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 419 transitions, 5647 flow [2025-01-09 16:43:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.16) internal successors, (204), 25 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:43:33,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:33,445 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:33,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:43:33,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:33,646 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:33,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:33,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1746869613, now seen corresponding path program 4 times [2025-01-09 16:43:33,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:33,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111425113] [2025-01-09 16:43:33,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:33,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:33,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:43:33,661 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:33,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:33,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:33,817 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-09 16:43:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:33,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111425113] [2025-01-09 16:43:33,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111425113] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:33,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:33,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:43:33,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291556498] [2025-01-09 16:43:33,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:33,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:43:33,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:33,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:43:33,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:43:33,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-01-09 16:43:33,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 419 transitions, 5647 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-09 16:43:33,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:33,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-01-09 16:43:33,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:34,918 INFO L124 PetriNetUnfolderBase]: 2972/5857 cut-off events. [2025-01-09 16:43:34,918 INFO L125 PetriNetUnfolderBase]: For 96858/97343 co-relation queries the response was YES. [2025-01-09 16:43:34,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36615 conditions, 5857 events. 2972/5857 cut-off events. For 96858/97343 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 44262 event pairs, 441 based on Foata normal form. 37/5795 useless extension candidates. Maximal degree in co-relation 36374. Up to 1753 conditions per place. [2025-01-09 16:43:34,985 INFO L140 encePairwiseOnDemand]: 19/25 looper letters, 443 selfloop transitions, 232 changer transitions 0/704 dead transitions. [2025-01-09 16:43:34,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 704 transitions, 11167 flow [2025-01-09 16:43:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:43:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:43:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-01-09 16:43:34,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2025-01-09 16:43:34,987 INFO L175 Difference]: Start difference. First operand has 202 places, 419 transitions, 5647 flow. Second operand 7 states and 107 transitions. [2025-01-09 16:43:34,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 704 transitions, 11167 flow [2025-01-09 16:43:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 704 transitions, 9903 flow, removed 590 selfloop flow, removed 14 redundant places. [2025-01-09 16:43:35,386 INFO L231 Difference]: Finished difference. Result has 196 places, 533 transitions, 7340 flow [2025-01-09 16:43:35,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4910, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7340, PETRI_PLACES=196, PETRI_TRANSITIONS=533} [2025-01-09 16:43:35,387 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 169 predicate places. [2025-01-09 16:43:35,387 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 533 transitions, 7340 flow [2025-01-09 16:43:35,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-09 16:43:35,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:35,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:35,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:43:35,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:35,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash 83849991, now seen corresponding path program 5 times [2025-01-09 16:43:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:35,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184436652] [2025-01-09 16:43:35,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:43:35,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:35,393 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 16:43:35,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:43:35,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:35,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:35,591 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-09 16:43:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184436652] [2025-01-09 16:43:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184436652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:43:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:43:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:43:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467063318] [2025-01-09 16:43:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:43:35,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:43:35,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:35,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:43:35,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:43:35,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2025-01-09 16:43:35,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 533 transitions, 7340 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-09 16:43:35,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:35,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2025-01-09 16:43:35,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:37,024 INFO L124 PetriNetUnfolderBase]: 4744/8410 cut-off events. [2025-01-09 16:43:37,024 INFO L125 PetriNetUnfolderBase]: For 148213/149279 co-relation queries the response was YES. [2025-01-09 16:43:37,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53163 conditions, 8410 events. 4744/8410 cut-off events. For 148213/149279 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 59279 event pairs, 43 based on Foata normal form. 172/8541 useless extension candidates. Maximal degree in co-relation 49907. Up to 2498 conditions per place. [2025-01-09 16:43:37,103 INFO L140 encePairwiseOnDemand]: 17/25 looper letters, 713 selfloop transitions, 347 changer transitions 0/1088 dead transitions. [2025-01-09 16:43:37,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 1088 transitions, 17193 flow [2025-01-09 16:43:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:43:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:43:37,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2025-01-09 16:43:37,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-01-09 16:43:37,105 INFO L175 Difference]: Start difference. First operand has 196 places, 533 transitions, 7340 flow. Second operand 9 states and 111 transitions. [2025-01-09 16:43:37,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 1088 transitions, 17193 flow [2025-01-09 16:43:37,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1088 transitions, 16997 flow, removed 94 selfloop flow, removed 2 redundant places. [2025-01-09 16:43:37,645 INFO L231 Difference]: Finished difference. Result has 207 places, 707 transitions, 11540 flow [2025-01-09 16:43:37,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=6994, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11540, PETRI_PLACES=207, PETRI_TRANSITIONS=707} [2025-01-09 16:43:37,646 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 180 predicate places. [2025-01-09 16:43:37,646 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 707 transitions, 11540 flow [2025-01-09 16:43:37,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-09 16:43:37,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:37,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:37,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:43:37,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:37,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1717237636, now seen corresponding path program 4 times [2025-01-09 16:43:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:37,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635124681] [2025-01-09 16:43:37,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:37,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:43:37,677 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:37,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:37,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635124681] [2025-01-09 16:43:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635124681] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964787928] [2025-01-09 16:43:38,842 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:43:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:38,844 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-09 16:43:38,845 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-09 16:43:38,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:43:38,899 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:38,899 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:43:38,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:38,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 16:43:38,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:39,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:39,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:40,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:40,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964787928] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:40,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:40,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-01-09 16:43:40,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624522392] [2025-01-09 16:43:40,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:40,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:43:40,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:40,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:43:40,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:43:40,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-01-09 16:43:40,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 707 transitions, 11540 flow. Second operand has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 26 states have internal predecessors, (191), 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-09 16:43:40,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:40,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-01-09 16:43:40,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:43:52,820 INFO L124 PetriNetUnfolderBase]: 8160/13833 cut-off events. [2025-01-09 16:43:52,820 INFO L125 PetriNetUnfolderBase]: For 276262/276262 co-relation queries the response was YES. [2025-01-09 16:43:52,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99910 conditions, 13833 events. 8160/13833 cut-off events. For 276262/276262 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 98356 event pairs, 138 based on Foata normal form. 22/13854 useless extension candidates. Maximal degree in co-relation 91899. Up to 5695 conditions per place. [2025-01-09 16:43:52,941 INFO L140 encePairwiseOnDemand]: 12/25 looper letters, 829 selfloop transitions, 463 changer transitions 135/1430 dead transitions. [2025-01-09 16:43:52,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1430 transitions, 24293 flow [2025-01-09 16:43:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-01-09 16:43:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-01-09 16:43:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 683 transitions. [2025-01-09 16:43:52,944 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4478688524590164 [2025-01-09 16:43:52,944 INFO L175 Difference]: Start difference. First operand has 207 places, 707 transitions, 11540 flow. Second operand 61 states and 683 transitions. [2025-01-09 16:43:52,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1430 transitions, 24293 flow [2025-01-09 16:43:54,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 1430 transitions, 24178 flow, removed 56 selfloop flow, removed 1 redundant places. [2025-01-09 16:43:54,024 INFO L231 Difference]: Finished difference. Result has 301 places, 999 transitions, 18534 flow [2025-01-09 16:43:54,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=11513, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=18534, PETRI_PLACES=301, PETRI_TRANSITIONS=999} [2025-01-09 16:43:54,025 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 274 predicate places. [2025-01-09 16:43:54,025 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 999 transitions, 18534 flow [2025-01-09 16:43:54,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.346153846153846) internal successors, (191), 26 states have internal predecessors, (191), 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-09 16:43:54,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:43:54,025 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:43:54,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:43:54,226 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-09 16:43:54,226 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:43:54,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:43:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1947642048, now seen corresponding path program 5 times [2025-01-09 16:43:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:43:54,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24091219] [2025-01-09 16:43:54,227 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:43:54,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:43:54,232 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:43:54,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:54,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:54,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:43:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24091219] [2025-01-09 16:43:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24091219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:43:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599981800] [2025-01-09 16:43:55,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:43:55,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:43:55,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:43:55,075 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:43:55,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:43:55,108 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:43:55,141 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:43:55,142 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:43:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:43:55,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 16:43:55,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:43:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:56,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:43:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:43:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599981800] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:43:57,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:43:57,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 31 [2025-01-09 16:43:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696785053] [2025-01-09 16:43:57,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:43:57,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 16:43:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:43:57,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 16:43:57,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-01-09 16:43:57,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 25 [2025-01-09 16:43:57,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 999 transitions, 18534 flow. Second operand has 32 states, 32 states have (on average 6.96875) internal successors, (223), 32 states have internal predecessors, (223), 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-09 16:43:57,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:43:57,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 25 [2025-01-09 16:43:57,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand