./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:33:56,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:33:56,695 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:33:56,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:33:56,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:33:56,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:33:56,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:33:56,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:33:56,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:33:56,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:33:56,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:33:56,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:33:56,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:33:56,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:33:56,721 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:33:56,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:33:56,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:33:56,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:33:56,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:33:56,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:33:56,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:33:56,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:33:56,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:33:56,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:33:56,723 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:33:56,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:33:56,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:33:56,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:33:56,724 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:33:56,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:56,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:33:56,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:56,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:33:56,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:33:56,726 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-01-09 16:33:56,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:33:56,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:33:57,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:33:57,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:33:57,002 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:33:57,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-09 16:33:58,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7301310cb/bc31c3b462254f72bde2d37ed61bb7f9/FLAG00f2c710a [2025-01-09 16:33:58,600 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:33:58,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-09 16:33:58,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7301310cb/bc31c3b462254f72bde2d37ed61bb7f9/FLAG00f2c710a [2025-01-09 16:33:58,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7301310cb/bc31c3b462254f72bde2d37ed61bb7f9 [2025-01-09 16:33:58,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:33:58,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:33:58,647 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:58,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:33:58,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:33:58,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:58" (1/1) ... [2025-01-09 16:33:58,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7e7f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:58, skipping insertion in model container [2025-01-09 16:33:58,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:58" (1/1) ... [2025-01-09 16:33:58,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:33:58,819 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-01-09 16:33:58,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:58,959 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:33:58,969 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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-01-09 16:33:59,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:33:59,040 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:33:59,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59 WrapperNode [2025-01-09 16:33:59,043 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:33:59,044 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:59,044 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:33:59,044 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:33:59,049 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:33:59" (1/1) ... [2025-01-09 16:33:59,059 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:33:59" (1/1) ... [2025-01-09 16:33:59,078 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-01-09 16:33:59,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:33:59,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:33:59,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:33:59,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:33:59,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,109 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:33:59,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,118 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,123 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:33:59,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:33:59,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:33:59,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:33:59,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (1/1) ... [2025-01-09 16:33:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:33:59,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:33:59,154 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:33:59,157 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:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-01-09 16:33:59,183 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-01-09 16:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:33:59,183 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:33:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:33:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:33:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:33:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:33:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:33:59,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:33:59,186 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:33:59,328 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:33:59,330 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:33:59,551 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:33:59,551 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:33:59,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:33:59,698 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 16:33:59,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59 BoogieIcfgContainer [2025-01-09 16:33:59,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:33:59,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:33:59,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:33:59,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:33:59,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:58" (1/3) ... [2025-01-09 16:33:59,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce1b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 16:33:59,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:59" (2/3) ... [2025-01-09 16:33:59,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce1b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 16:33:59,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59" (3/3) ... [2025-01-09 16:33:59,707 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-01-09 16:33:59,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:33:59,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-01-09 16:33:59,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:33:59,791 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:33:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-01-09 16:33:59,857 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-01-09 16:33:59,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:33:59,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-01-09 16:33:59,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-01-09 16:33:59,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-01-09 16:33:59,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:33:59,898 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;@715b8ac5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:33:59,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:33:59,915 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:33:59,915 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-01-09 16:33:59,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:33:59,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:33:59,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:33:59,917 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:33:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:33:59,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1293738985, now seen corresponding path program 1 times [2025-01-09 16:33:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:33:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517423308] [2025-01-09 16:33:59,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:33:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:00,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:34:00,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:34:00,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:00,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:00,143 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:34:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517423308] [2025-01-09 16:34:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517423308] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:00,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:00,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:34:00,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510999205] [2025-01-09 16:34:00,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 16:34:00,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:00,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 16:34:00,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 16:34:00,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-01-09 16:34:00,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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:34:00,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:00,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-01-09 16:34:00,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:00,308 INFO L124 PetriNetUnfolderBase]: 102/244 cut-off events. [2025-01-09 16:34:00,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:34:00,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 244 events. 102/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 944 event pairs, 66 based on Foata normal form. 21/221 useless extension candidates. Maximal degree in co-relation 421. Up to 182 conditions per place. [2025-01-09 16:34:00,314 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 21 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-01-09 16:34:00,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 109 flow [2025-01-09 16:34:00,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 16:34:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-09 16:34:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2025-01-09 16:34:00,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2025-01-09 16:34:00,328 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 2 states and 49 transitions. [2025-01-09 16:34:00,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 109 flow [2025-01-09 16:34:00,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:34:00,335 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 66 flow [2025-01-09 16:34:00,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-01-09 16:34:00,340 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-01-09 16:34:00,341 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 66 flow [2025-01-09 16:34:00,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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:34:00,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:00,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:00,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:34:00,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:00,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:00,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1293770763, now seen corresponding path program 1 times [2025-01-09 16:34:00,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:00,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301645184] [2025-01-09 16:34:00,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:00,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:00,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 16:34:00,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 16:34:00,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:00,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:00,650 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:34:00,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:00,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301645184] [2025-01-09 16:34:00,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301645184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:00,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:00,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:34:00,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102490091] [2025-01-09 16:34:00,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:00,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:34:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:00,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:34:00,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:34:00,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:00,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:34:00,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:00,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:00,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:00,940 INFO L124 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-01-09 16:34:00,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:34:00,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 450 events. 218/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1938 event pairs, 20 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 857. Up to 241 conditions per place. [2025-01-09 16:34:00,945 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-01-09 16:34:00,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 264 flow [2025-01-09 16:34:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:34:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:34:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-01-09 16:34:00,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-01-09 16:34:00,949 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 66 flow. Second operand 6 states and 112 transitions. [2025-01-09 16:34:00,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 264 flow [2025-01-09 16:34:00,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:00,952 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 168 flow [2025-01-09 16:34:00,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2025-01-09 16:34:00,953 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-01-09 16:34:00,954 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 168 flow [2025-01-09 16:34:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:34:00,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:00,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:00,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:34:00,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:00,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1452153518, now seen corresponding path program 1 times [2025-01-09 16:34:00,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:00,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454047282] [2025-01-09 16:34:00,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:00,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:00,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:34:00,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:34:00,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:00,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:01,060 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:34:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454047282] [2025-01-09 16:34:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454047282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:34:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640310352] [2025-01-09 16:34:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:34:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:01,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:34:01,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:34:01,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:34:01,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:34:01,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:01,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:34:01,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:01,305 INFO L124 PetriNetUnfolderBase]: 278/559 cut-off events. [2025-01-09 16:34:01,305 INFO L125 PetriNetUnfolderBase]: For 184/186 co-relation queries the response was YES. [2025-01-09 16:34:01,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 559 events. 278/559 cut-off events. For 184/186 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2460 event pairs, 60 based on Foata normal form. 20/538 useless extension candidates. Maximal degree in co-relation 1390. Up to 303 conditions per place. [2025-01-09 16:34:01,314 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-01-09 16:34:01,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 474 flow [2025-01-09 16:34:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:34:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:34:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-01-09 16:34:01,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-01-09 16:34:01,317 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-01-09 16:34:01,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 474 flow [2025-01-09 16:34:01,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:01,326 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 366 flow [2025-01-09 16:34:01,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=52, PETRI_TRANSITIONS=60} [2025-01-09 16:34:01,328 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-01-09 16:34:01,328 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 366 flow [2025-01-09 16:34:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:34:01,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:01,328 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:01,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:34:01,328 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1942437297, now seen corresponding path program 1 times [2025-01-09 16:34:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:01,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456935453] [2025-01-09 16:34:01,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:01,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:01,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:01,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:01,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:01,676 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:34:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:01,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456935453] [2025-01-09 16:34:01,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456935453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:01,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:01,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:34:01,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300889033] [2025-01-09 16:34:01,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:34:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:01,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:34:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:34:01,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-01-09 16:34:01,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:01,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:01,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-01-09 16:34:01,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:02,027 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-01-09 16:34:02,027 INFO L125 PetriNetUnfolderBase]: For 1245/1262 co-relation queries the response was YES. [2025-01-09 16:34:02,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 859 events. 399/859 cut-off events. For 1245/1262 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4779 event pairs, 86 based on Foata normal form. 16/819 useless extension candidates. Maximal degree in co-relation 2730. Up to 360 conditions per place. [2025-01-09 16:34:02,034 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-01-09 16:34:02,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 942 flow [2025-01-09 16:34:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:34:02,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:34:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-01-09 16:34:02,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-01-09 16:34:02,036 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-01-09 16:34:02,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 942 flow [2025-01-09 16:34:02,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:02,048 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 588 flow [2025-01-09 16:34:02,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2025-01-09 16:34:02,050 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-01-09 16:34:02,051 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 588 flow [2025-01-09 16:34:02,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:02,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:02,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:02,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:34:02,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:02,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash -566574497, now seen corresponding path program 2 times [2025-01-09 16:34:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:02,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757638914] [2025-01-09 16:34:02,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:34:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:02,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:02,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:02,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:34:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:02,568 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:34:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757638914] [2025-01-09 16:34:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757638914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:34:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326406591] [2025-01-09 16:34:02,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:02,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:02,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:02,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:02,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:02,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:02,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:02,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:02,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:03,100 INFO L124 PetriNetUnfolderBase]: 468/945 cut-off events. [2025-01-09 16:34:03,100 INFO L125 PetriNetUnfolderBase]: For 1980/2011 co-relation queries the response was YES. [2025-01-09 16:34:03,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 945 events. 468/945 cut-off events. For 1980/2011 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4983 event pairs, 104 based on Foata normal form. 32/971 useless extension candidates. Maximal degree in co-relation 3452. Up to 583 conditions per place. [2025-01-09 16:34:03,108 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 67 selfloop transitions, 61 changer transitions 0/136 dead transitions. [2025-01-09 16:34:03,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 136 transitions, 1241 flow [2025-01-09 16:34:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:34:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:34:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2025-01-09 16:34:03,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4074844074844075 [2025-01-09 16:34:03,111 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 588 flow. Second operand 13 states and 196 transitions. [2025-01-09 16:34:03,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 136 transitions, 1241 flow [2025-01-09 16:34:03,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 136 transitions, 1205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:34:03,125 INFO L231 Difference]: Finished difference. Result has 74 places, 108 transitions, 999 flow [2025-01-09 16:34:03,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=999, PETRI_PLACES=74, PETRI_TRANSITIONS=108} [2025-01-09 16:34:03,128 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 41 predicate places. [2025-01-09 16:34:03,129 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 108 transitions, 999 flow [2025-01-09 16:34:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:03,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:03,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:03,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:34:03,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:03,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1307763121, now seen corresponding path program 3 times [2025-01-09 16:34:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683000169] [2025-01-09 16:34:03,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:34:03,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:03,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:03,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:03,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:34:03,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:03,372 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:34:03,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:03,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683000169] [2025-01-09 16:34:03,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683000169] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:03,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:34:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550000570] [2025-01-09 16:34:03,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:03,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:34:03,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:34:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:34:03,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-01-09 16:34:03,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 108 transitions, 999 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:03,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:03,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-01-09 16:34:03,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:03,759 INFO L124 PetriNetUnfolderBase]: 662/1433 cut-off events. [2025-01-09 16:34:03,760 INFO L125 PetriNetUnfolderBase]: For 3690/3715 co-relation queries the response was YES. [2025-01-09 16:34:03,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5517 conditions, 1433 events. 662/1433 cut-off events. For 3690/3715 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8176 event pairs, 143 based on Foata normal form. 16/1447 useless extension candidates. Maximal degree in co-relation 5497. Up to 530 conditions per place. [2025-01-09 16:34:03,800 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 128 selfloop transitions, 43 changer transitions 0/186 dead transitions. [2025-01-09 16:34:03,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 186 transitions, 1809 flow [2025-01-09 16:34:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:34:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:34:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2025-01-09 16:34:03,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-01-09 16:34:03,802 INFO L175 Difference]: Start difference. First operand has 74 places, 108 transitions, 999 flow. Second operand 7 states and 168 transitions. [2025-01-09 16:34:03,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 186 transitions, 1809 flow [2025-01-09 16:34:03,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 186 transitions, 1737 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-09 16:34:03,821 INFO L231 Difference]: Finished difference. Result has 80 places, 118 transitions, 1153 flow [2025-01-09 16:34:03,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1153, PETRI_PLACES=80, PETRI_TRANSITIONS=118} [2025-01-09 16:34:03,822 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 47 predicate places. [2025-01-09 16:34:03,822 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 118 transitions, 1153 flow [2025-01-09 16:34:03,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:03,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:03,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:03,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:34:03,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:03,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 392464637, now seen corresponding path program 4 times [2025-01-09 16:34:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177382432] [2025-01-09 16:34:03,823 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:34:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:03,832 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-01-09 16:34:03,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-01-09 16:34:03,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:34:03,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:03,905 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:34:03,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:03,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177382432] [2025-01-09 16:34:03,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177382432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:03,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:03,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:34:03,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577626030] [2025-01-09 16:34:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:03,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:34:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:03,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:34:03,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:34:03,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-01-09 16:34:03,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 118 transitions, 1153 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:34:03,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:03,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-01-09 16:34:03,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:04,336 INFO L124 PetriNetUnfolderBase]: 1036/2158 cut-off events. [2025-01-09 16:34:04,337 INFO L125 PetriNetUnfolderBase]: For 7224/7361 co-relation queries the response was YES. [2025-01-09 16:34:04,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8824 conditions, 2158 events. 1036/2158 cut-off events. For 7224/7361 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 13731 event pairs, 40 based on Foata normal form. 122/2274 useless extension candidates. Maximal degree in co-relation 8800. Up to 724 conditions per place. [2025-01-09 16:34:04,355 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 213 selfloop transitions, 38 changer transitions 0/269 dead transitions. [2025-01-09 16:34:04,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 269 transitions, 2969 flow [2025-01-09 16:34:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:34:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:34:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2025-01-09 16:34:04,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640926640926641 [2025-01-09 16:34:04,357 INFO L175 Difference]: Start difference. First operand has 80 places, 118 transitions, 1153 flow. Second operand 7 states and 172 transitions. [2025-01-09 16:34:04,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 269 transitions, 2969 flow [2025-01-09 16:34:04,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 269 transitions, 2830 flow, removed 52 selfloop flow, removed 2 redundant places. [2025-01-09 16:34:04,385 INFO L231 Difference]: Finished difference. Result has 89 places, 140 transitions, 1362 flow [2025-01-09 16:34:04,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1362, PETRI_PLACES=89, PETRI_TRANSITIONS=140} [2025-01-09 16:34:04,386 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2025-01-09 16:34:04,386 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 140 transitions, 1362 flow [2025-01-09 16:34:04,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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:34:04,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:04,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:04,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:34:04,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:04,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1595044555, now seen corresponding path program 5 times [2025-01-09 16:34:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:04,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524495335] [2025-01-09 16:34:04,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:34:04,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:04,396 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:04,403 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:04,404 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:34:04,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:04,586 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:34:04,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:04,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524495335] [2025-01-09 16:34:04,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524495335] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:04,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:04,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:34:04,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117508914] [2025-01-09 16:34:04,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:04,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:34:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:04,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:34:04,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:34:04,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-01-09 16:34:04,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 140 transitions, 1362 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:04,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:04,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-01-09 16:34:04,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:05,098 INFO L124 PetriNetUnfolderBase]: 1056/2288 cut-off events. [2025-01-09 16:34:05,099 INFO L125 PetriNetUnfolderBase]: For 9207/9257 co-relation queries the response was YES. [2025-01-09 16:34:05,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 2288 events. 1056/2288 cut-off events. For 9207/9257 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14595 event pairs, 300 based on Foata normal form. 27/2305 useless extension candidates. Maximal degree in co-relation 10711. Up to 1399 conditions per place. [2025-01-09 16:34:05,122 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 161 selfloop transitions, 41 changer transitions 0/217 dead transitions. [2025-01-09 16:34:05,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 217 transitions, 2354 flow [2025-01-09 16:34:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:34:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:34:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-01-09 16:34:05,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-01-09 16:34:05,125 INFO L175 Difference]: Start difference. First operand has 89 places, 140 transitions, 1362 flow. Second operand 7 states and 166 transitions. [2025-01-09 16:34:05,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 217 transitions, 2354 flow [2025-01-09 16:34:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 217 transitions, 2330 flow, removed 12 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:05,167 INFO L231 Difference]: Finished difference. Result has 97 places, 148 transitions, 1580 flow [2025-01-09 16:34:05,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1354, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1580, PETRI_PLACES=97, PETRI_TRANSITIONS=148} [2025-01-09 16:34:05,170 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 64 predicate places. [2025-01-09 16:34:05,170 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 148 transitions, 1580 flow [2025-01-09 16:34:05,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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:34:05,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:05,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:05,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:34:05,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:05,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash 229410093, now seen corresponding path program 6 times [2025-01-09 16:34:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966923040] [2025-01-09 16:34:05,172 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:34:05,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:05,180 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:05,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:05,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:34:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:05,566 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:34:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:05,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966923040] [2025-01-09 16:34:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966923040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:05,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:05,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:34:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216410244] [2025-01-09 16:34:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:05,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:05,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:05,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:05,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:05,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 148 transitions, 1580 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:06,120 INFO L124 PetriNetUnfolderBase]: 1174/2404 cut-off events. [2025-01-09 16:34:06,121 INFO L125 PetriNetUnfolderBase]: For 10972/11102 co-relation queries the response was YES. [2025-01-09 16:34:06,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11622 conditions, 2404 events. 1174/2404 cut-off events. For 10972/11102 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 14664 event pairs, 311 based on Foata normal form. 112/2495 useless extension candidates. Maximal degree in co-relation 11589. Up to 1740 conditions per place. [2025-01-09 16:34:06,150 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 114 selfloop transitions, 68 changer transitions 0/192 dead transitions. [2025-01-09 16:34:06,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 192 transitions, 2255 flow [2025-01-09 16:34:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:34:06,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:34:06,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-01-09 16:34:06,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-01-09 16:34:06,153 INFO L175 Difference]: Start difference. First operand has 97 places, 148 transitions, 1580 flow. Second operand 9 states and 150 transitions. [2025-01-09 16:34:06,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 192 transitions, 2255 flow [2025-01-09 16:34:06,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 192 transitions, 2145 flow, removed 18 selfloop flow, removed 4 redundant places. [2025-01-09 16:34:06,226 INFO L231 Difference]: Finished difference. Result has 105 places, 164 transitions, 1859 flow [2025-01-09 16:34:06,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1859, PETRI_PLACES=105, PETRI_TRANSITIONS=164} [2025-01-09 16:34:06,227 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 72 predicate places. [2025-01-09 16:34:06,227 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 164 transitions, 1859 flow [2025-01-09 16:34:06,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:06,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:06,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:06,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:34:06,228 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:06,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:06,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1837504225, now seen corresponding path program 7 times [2025-01-09 16:34:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456536582] [2025-01-09 16:34:06,229 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:34:06,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:06,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:34:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:34:06,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:06,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:06,496 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:34:06,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456536582] [2025-01-09 16:34:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456536582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:06,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:06,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:34:06,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101950120] [2025-01-09 16:34:06,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:06,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:06,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:06,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:06,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:06,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 164 transitions, 1859 flow. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:06,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:06,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:06,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:07,042 INFO L124 PetriNetUnfolderBase]: 1022/2103 cut-off events. [2025-01-09 16:34:07,043 INFO L125 PetriNetUnfolderBase]: For 9658/9790 co-relation queries the response was YES. [2025-01-09 16:34:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10314 conditions, 2103 events. 1022/2103 cut-off events. For 9658/9790 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 12590 event pairs, 291 based on Foata normal form. 116/2198 useless extension candidates. Maximal degree in co-relation 10277. Up to 1570 conditions per place. [2025-01-09 16:34:07,062 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 116 selfloop transitions, 47 changer transitions 0/173 dead transitions. [2025-01-09 16:34:07,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 173 transitions, 1998 flow [2025-01-09 16:34:07,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:34:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:34:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2025-01-09 16:34:07,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2025-01-09 16:34:07,064 INFO L175 Difference]: Start difference. First operand has 105 places, 164 transitions, 1859 flow. Second operand 10 states and 166 transitions. [2025-01-09 16:34:07,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 173 transitions, 1998 flow [2025-01-09 16:34:07,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 173 transitions, 1933 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-01-09 16:34:07,100 INFO L231 Difference]: Finished difference. Result has 109 places, 145 transitions, 1552 flow [2025-01-09 16:34:07,101 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1552, PETRI_PLACES=109, PETRI_TRANSITIONS=145} [2025-01-09 16:34:07,101 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 76 predicate places. [2025-01-09 16:34:07,101 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 145 transitions, 1552 flow [2025-01-09 16:34:07,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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:34:07,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:07,102 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:07,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:34:07,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:07,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash 884299226, now seen corresponding path program 1 times [2025-01-09 16:34:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444816881] [2025-01-09 16:34:07,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:07,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:34:07,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:34:07,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:07,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:07,496 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:34:07,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:07,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444816881] [2025-01-09 16:34:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444816881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:34:07,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682832457] [2025-01-09 16:34:07,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:07,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:34:07,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:07,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:34:07,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:34:07,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:07,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 145 transitions, 1552 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:07,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:07,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:07,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:08,560 INFO L124 PetriNetUnfolderBase]: 1984/3985 cut-off events. [2025-01-09 16:34:08,561 INFO L125 PetriNetUnfolderBase]: For 20121/20351 co-relation queries the response was YES. [2025-01-09 16:34:08,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19740 conditions, 3985 events. 1984/3985 cut-off events. For 20121/20351 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 25358 event pairs, 435 based on Foata normal form. 268/4219 useless extension candidates. Maximal degree in co-relation 19704. Up to 1706 conditions per place. [2025-01-09 16:34:08,597 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 242 selfloop transitions, 161 changer transitions 0/413 dead transitions. [2025-01-09 16:34:08,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 413 transitions, 4764 flow [2025-01-09 16:34:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:34:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:34:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 301 transitions. [2025-01-09 16:34:08,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5423423423423424 [2025-01-09 16:34:08,599 INFO L175 Difference]: Start difference. First operand has 109 places, 145 transitions, 1552 flow. Second operand 15 states and 301 transitions. [2025-01-09 16:34:08,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 413 transitions, 4764 flow [2025-01-09 16:34:08,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 413 transitions, 4607 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-01-09 16:34:08,660 INFO L231 Difference]: Finished difference. Result has 130 places, 279 transitions, 3575 flow [2025-01-09 16:34:08,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3575, PETRI_PLACES=130, PETRI_TRANSITIONS=279} [2025-01-09 16:34:08,662 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2025-01-09 16:34:08,662 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 279 transitions, 3575 flow [2025-01-09 16:34:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:08,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:08,662 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:08,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:34:08,663 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1298620014, now seen corresponding path program 2 times [2025-01-09 16:34:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:08,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111507446] [2025-01-09 16:34:08,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:34:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:08,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:34:08,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-01-09 16:34:08,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:34:08,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:34:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111507446] [2025-01-09 16:34:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111507446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:34:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070320918] [2025-01-09 16:34:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:08,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:08,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:08,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:08,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:34:08,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 279 transitions, 3575 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:08,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:08,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:34:08,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:10,066 INFO L124 PetriNetUnfolderBase]: 2517/4971 cut-off events. [2025-01-09 16:34:10,066 INFO L125 PetriNetUnfolderBase]: For 41100/41140 co-relation queries the response was YES. [2025-01-09 16:34:10,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29380 conditions, 4971 events. 2517/4971 cut-off events. For 41100/41140 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 32245 event pairs, 346 based on Foata normal form. 44/5009 useless extension candidates. Maximal degree in co-relation 29332. Up to 1929 conditions per place. [2025-01-09 16:34:10,104 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 284 selfloop transitions, 278 changer transitions 0/568 dead transitions. [2025-01-09 16:34:10,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 568 transitions, 8116 flow [2025-01-09 16:34:10,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:34:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:34:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 219 transitions. [2025-01-09 16:34:10,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42277992277992277 [2025-01-09 16:34:10,106 INFO L175 Difference]: Start difference. First operand has 130 places, 279 transitions, 3575 flow. Second operand 14 states and 219 transitions. [2025-01-09 16:34:10,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 568 transitions, 8116 flow [2025-01-09 16:34:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 568 transitions, 8006 flow, removed 55 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:10,316 INFO L231 Difference]: Finished difference. Result has 155 places, 454 transitions, 7003 flow [2025-01-09 16:34:10,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3525, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7003, PETRI_PLACES=155, PETRI_TRANSITIONS=454} [2025-01-09 16:34:10,317 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 122 predicate places. [2025-01-09 16:34:10,318 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 454 transitions, 7003 flow [2025-01-09 16:34:10,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:10,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:10,319 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:34:10,320 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:10,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1288788984, now seen corresponding path program 3 times [2025-01-09 16:34:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:10,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710442683] [2025-01-09 16:34:10,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:34:10,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:10,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:34:10,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-01-09 16:34:10,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:34:10,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:34:10,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:10,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710442683] [2025-01-09 16:34:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710442683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:34:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581160047] [2025-01-09 16:34:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:10,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:10,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:10,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:10,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:34:10,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 454 transitions, 7003 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:10,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:10,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:34:10,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:12,064 INFO L124 PetriNetUnfolderBase]: 2605/5175 cut-off events. [2025-01-09 16:34:12,064 INFO L125 PetriNetUnfolderBase]: For 62667/62677 co-relation queries the response was YES. [2025-01-09 16:34:12,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35007 conditions, 5175 events. 2605/5175 cut-off events. For 62667/62677 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 33821 event pairs, 156 based on Foata normal form. 26/5199 useless extension candidates. Maximal degree in co-relation 34947. Up to 1282 conditions per place. [2025-01-09 16:34:12,110 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 238 selfloop transitions, 431 changer transitions 0/675 dead transitions. [2025-01-09 16:34:12,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 675 transitions, 11182 flow [2025-01-09 16:34:12,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 16:34:12,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-09 16:34:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 259 transitions. [2025-01-09 16:34:12,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-01-09 16:34:12,112 INFO L175 Difference]: Start difference. First operand has 155 places, 454 transitions, 7003 flow. Second operand 17 states and 259 transitions. [2025-01-09 16:34:12,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 675 transitions, 11182 flow [2025-01-09 16:34:12,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 675 transitions, 10936 flow, removed 123 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:12,491 INFO L231 Difference]: Finished difference. Result has 181 places, 589 transitions, 10353 flow [2025-01-09 16:34:12,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6805, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10353, PETRI_PLACES=181, PETRI_TRANSITIONS=589} [2025-01-09 16:34:12,492 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 148 predicate places. [2025-01-09 16:34:12,492 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 589 transitions, 10353 flow [2025-01-09 16:34:12,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:12,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:12,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:12,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 16:34:12,493 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1132066954, now seen corresponding path program 4 times [2025-01-09 16:34:12,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356408006] [2025-01-09 16:34:12,494 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:34:12,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:12,502 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-01-09 16:34:12,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-01-09 16:34:12,505 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:34:12,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:12,680 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:34:12,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356408006] [2025-01-09 16:34:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356408006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:34:12,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132706774] [2025-01-09 16:34:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:34:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:12,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:34:12,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:34:12,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-01-09 16:34:12,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 589 transitions, 10353 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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:34:12,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:12,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-01-09 16:34:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:13,779 INFO L124 PetriNetUnfolderBase]: 2255/4738 cut-off events. [2025-01-09 16:34:13,779 INFO L125 PetriNetUnfolderBase]: For 69930/70150 co-relation queries the response was YES. [2025-01-09 16:34:13,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35526 conditions, 4738 events. 2255/4738 cut-off events. For 69930/70150 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32517 event pairs, 155 based on Foata normal form. 201/4871 useless extension candidates. Maximal degree in co-relation 35456. Up to 1753 conditions per place. [2025-01-09 16:34:13,817 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 462 selfloop transitions, 258 changer transitions 0/796 dead transitions. [2025-01-09 16:34:13,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 796 transitions, 15229 flow [2025-01-09 16:34:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:34:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:34:13,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-01-09 16:34:13,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777027027027027 [2025-01-09 16:34:13,819 INFO L175 Difference]: Start difference. First operand has 181 places, 589 transitions, 10353 flow. Second operand 8 states and 171 transitions. [2025-01-09 16:34:13,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 796 transitions, 15229 flow [2025-01-09 16:34:14,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 796 transitions, 14857 flow, removed 164 selfloop flow, removed 2 redundant places. [2025-01-09 16:34:14,339 INFO L231 Difference]: Finished difference. Result has 188 places, 601 transitions, 10847 flow [2025-01-09 16:34:14,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10073, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=246, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10847, PETRI_PLACES=188, PETRI_TRANSITIONS=601} [2025-01-09 16:34:14,340 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 155 predicate places. [2025-01-09 16:34:14,340 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 601 transitions, 10847 flow [2025-01-09 16:34:14,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 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:34:14,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:14,340 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:14,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 16:34:14,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:14,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1492791518, now seen corresponding path program 5 times [2025-01-09 16:34:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981383570] [2025-01-09 16:34:14,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:34:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:14,351 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:34:14,356 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:34:14,357 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:34:14,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:14,744 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:34:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:14,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981383570] [2025-01-09 16:34:14,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981383570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:14,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:14,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 16:34:14,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381253322] [2025-01-09 16:34:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 16:34:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 16:34:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:34:14,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:34:14,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 601 transitions, 10847 flow. Second operand has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:34:14,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:14,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:34:14,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:17,870 INFO L124 PetriNetUnfolderBase]: 4696/9447 cut-off events. [2025-01-09 16:34:17,871 INFO L125 PetriNetUnfolderBase]: For 153451/153507 co-relation queries the response was YES. [2025-01-09 16:34:17,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74502 conditions, 9447 events. 4696/9447 cut-off events. For 153451/153507 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 69265 event pairs, 584 based on Foata normal form. 119/9530 useless extension candidates. Maximal degree in co-relation 74430. Up to 4015 conditions per place. [2025-01-09 16:34:17,957 INFO L140 encePairwiseOnDemand]: 20/37 looper letters, 735 selfloop transitions, 682 changer transitions 19/1442 dead transitions. [2025-01-09 16:34:17,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1442 transitions, 27960 flow [2025-01-09 16:34:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:34:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-09 16:34:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 444 transitions. [2025-01-09 16:34:17,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-01-09 16:34:17,960 INFO L175 Difference]: Start difference. First operand has 188 places, 601 transitions, 10847 flow. Second operand 27 states and 444 transitions. [2025-01-09 16:34:17,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1442 transitions, 27960 flow [2025-01-09 16:34:19,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1442 transitions, 27171 flow, removed 98 selfloop flow, removed 3 redundant places. [2025-01-09 16:34:19,178 INFO L231 Difference]: Finished difference. Result has 235 places, 1177 transitions, 24379 flow [2025-01-09 16:34:19,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10188, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=24379, PETRI_PLACES=235, PETRI_TRANSITIONS=1177} [2025-01-09 16:34:19,179 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 202 predicate places. [2025-01-09 16:34:19,179 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 1177 transitions, 24379 flow [2025-01-09 16:34:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.416666666666666) internal successors, (101), 12 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:34:19,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:19,179 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:19,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:34:19,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:19,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1268133150, now seen corresponding path program 6 times [2025-01-09 16:34:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442979613] [2025-01-09 16:34:19,180 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:34:19,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:19,189 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:34:19,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:34:19,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 16:34:19,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:19,370 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:34:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442979613] [2025-01-09 16:34:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442979613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:34:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567206318] [2025-01-09 16:34:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:34:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:19,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:34:19,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:34:19,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:34:19,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1177 transitions, 24379 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:19,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:19,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:34:19,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:23,415 INFO L124 PetriNetUnfolderBase]: 5145/10303 cut-off events. [2025-01-09 16:34:23,415 INFO L125 PetriNetUnfolderBase]: For 221626/221662 co-relation queries the response was YES. [2025-01-09 16:34:23,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89595 conditions, 10303 events. 5145/10303 cut-off events. For 221626/221662 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 76727 event pairs, 299 based on Foata normal form. 58/10342 useless extension candidates. Maximal degree in co-relation 89501. Up to 2281 conditions per place. [2025-01-09 16:34:23,519 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 510 selfloop transitions, 879 changer transitions 0/1395 dead transitions. [2025-01-09 16:34:23,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1395 transitions, 30723 flow [2025-01-09 16:34:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:34:23,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:34:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 215 transitions. [2025-01-09 16:34:23,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.446985446985447 [2025-01-09 16:34:23,521 INFO L175 Difference]: Start difference. First operand has 235 places, 1177 transitions, 24379 flow. Second operand 13 states and 215 transitions. [2025-01-09 16:34:23,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1395 transitions, 30723 flow [2025-01-09 16:34:25,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 1395 transitions, 29953 flow, removed 372 selfloop flow, removed 4 redundant places. [2025-01-09 16:34:25,938 INFO L231 Difference]: Finished difference. Result has 252 places, 1295 transitions, 29306 flow [2025-01-09 16:34:25,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=23719, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=762, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=29306, PETRI_PLACES=252, PETRI_TRANSITIONS=1295} [2025-01-09 16:34:25,940 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 219 predicate places. [2025-01-09 16:34:25,940 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 1295 transitions, 29306 flow [2025-01-09 16:34:25,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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:34:25,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:25,940 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:25,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 16:34:25,941 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1381669968, now seen corresponding path program 7 times [2025-01-09 16:34:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898747732] [2025-01-09 16:34:25,942 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:34:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:25,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:34:25,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:34:25,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:25,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:26,223 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:34:26,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:26,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898747732] [2025-01-09 16:34:26,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898747732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:26,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:26,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:34:26,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406949032] [2025-01-09 16:34:26,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:26,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:34:26,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:26,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:34:26,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:34:26,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:26,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 1295 transitions, 29306 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:26,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:26,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:26,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:32,792 INFO L124 PetriNetUnfolderBase]: 7574/15288 cut-off events. [2025-01-09 16:34:32,792 INFO L125 PetriNetUnfolderBase]: For 391124/391436 co-relation queries the response was YES. [2025-01-09 16:34:32,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145430 conditions, 15288 events. 7574/15288 cut-off events. For 391124/391436 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 122097 event pairs, 1232 based on Foata normal form. 55/15128 useless extension candidates. Maximal degree in co-relation 145326. Up to 8099 conditions per place. [2025-01-09 16:34:32,954 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 1394 selfloop transitions, 860 changer transitions 0/2283 dead transitions. [2025-01-09 16:34:32,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 2283 transitions, 55372 flow [2025-01-09 16:34:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:34:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:34:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 284 transitions. [2025-01-09 16:34:32,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5117117117117117 [2025-01-09 16:34:32,956 INFO L175 Difference]: Start difference. First operand has 252 places, 1295 transitions, 29306 flow. Second operand 15 states and 284 transitions. [2025-01-09 16:34:32,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 2283 transitions, 55372 flow [2025-01-09 16:34:38,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 2283 transitions, 54805 flow, removed 132 selfloop flow, removed 1 redundant places. [2025-01-09 16:34:38,450 INFO L231 Difference]: Finished difference. Result has 279 places, 1929 transitions, 47901 flow [2025-01-09 16:34:38,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=28973, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=315, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=47901, PETRI_PLACES=279, PETRI_TRANSITIONS=1929} [2025-01-09 16:34:38,453 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 246 predicate places. [2025-01-09 16:34:38,453 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 1929 transitions, 47901 flow [2025-01-09 16:34:38,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:38,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:38,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:38,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 16:34:38,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:38,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:38,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1773263536, now seen corresponding path program 8 times [2025-01-09 16:34:38,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:38,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618937123] [2025-01-09 16:34:38,455 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:34:38,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:38,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:34:38,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:34:38,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:34:38,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:38,736 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:34:38,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:38,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618937123] [2025-01-09 16:34:38,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618937123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:38,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:38,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:34:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548467400] [2025-01-09 16:34:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:34:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:38,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:34:38,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:34:38,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-01-09 16:34:38,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 1929 transitions, 47901 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:38,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:38,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-01-09 16:34:38,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:34:49,299 INFO L124 PetriNetUnfolderBase]: 9451/19018 cut-off events. [2025-01-09 16:34:49,300 INFO L125 PetriNetUnfolderBase]: For 598753/599141 co-relation queries the response was YES. [2025-01-09 16:34:49,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194020 conditions, 19018 events. 9451/19018 cut-off events. For 598753/599141 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 157629 event pairs, 1578 based on Foata normal form. 105/18851 useless extension candidates. Maximal degree in co-relation 193903. Up to 11772 conditions per place. [2025-01-09 16:34:49,628 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 1785 selfloop transitions, 889 changer transitions 0/2703 dead transitions. [2025-01-09 16:34:49,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 2703 transitions, 71688 flow [2025-01-09 16:34:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:34:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:34:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 282 transitions. [2025-01-09 16:34:49,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2025-01-09 16:34:49,630 INFO L175 Difference]: Start difference. First operand has 279 places, 1929 transitions, 47901 flow. Second operand 14 states and 282 transitions. [2025-01-09 16:34:49,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 2703 transitions, 71688 flow [2025-01-09 16:34:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 2703 transitions, 71224 flow, removed 232 selfloop flow, removed 0 redundant places. [2025-01-09 16:34:58,850 INFO L231 Difference]: Finished difference. Result has 305 places, 2422 transitions, 64604 flow [2025-01-09 16:34:58,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=47463, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=64604, PETRI_PLACES=305, PETRI_TRANSITIONS=2422} [2025-01-09 16:34:58,852 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 272 predicate places. [2025-01-09 16:34:58,853 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 2422 transitions, 64604 flow [2025-01-09 16:34:58,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:34:58,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:34:58,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:34:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 16:34:58,853 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:34:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:34:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 804449312, now seen corresponding path program 1 times [2025-01-09 16:34:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:34:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826382934] [2025-01-09 16:34:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:34:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:34:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:34:58,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:34:58,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:34:58,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:34:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:34:58,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:34:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826382934] [2025-01-09 16:34:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826382934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:34:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:34:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:34:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958505840] [2025-01-09 16:34:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:34:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:34:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:34:58,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:34:58,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:34:58,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-01-09 16:34:58,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 2422 transitions, 64604 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:34:58,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:34:58,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-01-09 16:34:58,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:35:12,719 INFO L124 PetriNetUnfolderBase]: 8775/18192 cut-off events. [2025-01-09 16:35:12,719 INFO L125 PetriNetUnfolderBase]: For 656513/656885 co-relation queries the response was YES. [2025-01-09 16:35:12,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195890 conditions, 18192 events. 8775/18192 cut-off events. For 656513/656885 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 154962 event pairs, 1835 based on Foata normal form. 22/18049 useless extension candidates. Maximal degree in co-relation 195760. Up to 15732 conditions per place. [2025-01-09 16:35:13,007 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 2117 selfloop transitions, 8 changer transitions 10/2409 dead transitions. [2025-01-09 16:35:13,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 2409 transitions, 68314 flow [2025-01-09 16:35:13,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:35:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:35:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-01-09 16:35:13,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-01-09 16:35:13,009 INFO L175 Difference]: Start difference. First operand has 305 places, 2422 transitions, 64604 flow. Second operand 5 states and 95 transitions. [2025-01-09 16:35:13,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 2409 transitions, 68314 flow [2025-01-09 16:35:22,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2409 transitions, 66568 flow, removed 870 selfloop flow, removed 2 redundant places. [2025-01-09 16:35:22,616 INFO L231 Difference]: Finished difference. Result has 308 places, 2398 transitions, 62158 flow [2025-01-09 16:35:22,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62271, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62158, PETRI_PLACES=308, PETRI_TRANSITIONS=2398} [2025-01-09 16:35:22,618 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 275 predicate places. [2025-01-09 16:35:22,618 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 2398 transitions, 62158 flow [2025-01-09 16:35:22,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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:35:22,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:35:22,618 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:35:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 16:35:22,618 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:35:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:35:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1400803236, now seen corresponding path program 9 times [2025-01-09 16:35:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:35:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707221852] [2025-01-09 16:35:22,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:35:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:35:22,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-09 16:35:22,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 25 statements. [2025-01-09 16:35:22,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:35:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:35:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 16:35:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:35:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707221852] [2025-01-09 16:35:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707221852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:35:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:35:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:35:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192409971] [2025-01-09 16:35:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:35:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:35:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:35:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:35:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:35:22,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-01-09 16:35:22,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 2398 transitions, 62158 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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:35:22,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:35:22,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-01-09 16:35:22,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand