./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:52:12,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:52:12,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:52:12,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:52:12,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:52:12,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:52:12,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:52:12,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:52:12,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:52:12,793 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:52:12,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:52:12,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:52:12,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:52:12,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:52:12,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:52:12,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:52:12,796 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:12,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:12,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:12,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:52:12,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:52:12,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:52:12,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:52:12,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:52:12,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:52:12,798 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/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 -> eaba04057472de7e0abee59642faf365bd5be09903096cb87fd907eb76891380 [2025-04-29 10:52:13,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:52:13,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:52:13,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:52:13,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:52:13,036 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:52:13,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 10:52:14,348 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290b586fd/33ecda6e606e46a68c8d10b969918941/FLAG60d391350 [2025-04-29 10:52:14,554 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:52:14,554 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 10:52:14,556 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:14,556 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:14,560 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290b586fd/33ecda6e606e46a68c8d10b969918941/FLAG60d391350 [2025-04-29 10:52:15,399 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/290b586fd/33ecda6e606e46a68c8d10b969918941 [2025-04-29 10:52:15,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:52:15,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:52:15,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:15,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:52:15,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:52:15,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2a44e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15, skipping insertion in model container [2025-04-29 10:52:15,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,416 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:52:15,547 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c[399,412] [2025-04-29 10:52:15,579 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:15,586 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:52:15,598 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.c[399,412] [2025-04-29 10:52:15,605 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:15,615 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:52:15,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15 WrapperNode [2025-04-29 10:52:15,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:15,617 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:15,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:52:15,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:52:15,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,645 INFO L138 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 104 [2025-04-29 10:52:15,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:15,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:52:15,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:52:15,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:52:15,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,658 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,667 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 3 writes are split as follows [3]. [2025-04-29 10:52:15,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:52:15,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:52:15,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:52:15,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:52:15,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (1/1) ... [2025-04-29 10:52:15,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:15,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:15,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 10:52:15,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:52:15,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:52:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:52:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:52:15,728 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-29 10:52:15,728 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-29 10:52:15,728 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 10:52:15,795 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:52:15,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:52:15,964 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:52:15,965 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:52:16,059 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:52:16,060 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:52:16,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:16 BoogieIcfgContainer [2025-04-29 10:52:16,060 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:52:16,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:52:16,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:52:16,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:52:16,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:52:15" (1/3) ... [2025-04-29 10:52:16,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a7b7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:16, skipping insertion in model container [2025-04-29 10:52:16,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:15" (2/3) ... [2025-04-29 10:52:16,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a7b7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:16, skipping insertion in model container [2025-04-29 10:52:16,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:16" (3/3) ... [2025-04-29 10:52:16,066 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c [2025-04-29 10:52:16,076 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:52:16,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.c that has 2 procedures, 31 locations, 36 edges, 1 initial locations, 3 loop locations, and 2 error locations. [2025-04-29 10:52:16,077 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:52:16,109 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 10:52:16,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-04-29 10:52:16,162 INFO L116 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-04-29 10:52:16,167 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:16,169 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 51 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-04-29 10:52:16,170 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-04-29 10:52:16,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-04-29 10:52:16,179 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:52:16,186 INFO L340 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;@44f03dd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:52:16,187 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-29 10:52:16,196 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:52:16,196 INFO L116 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-04-29 10:52:16,196 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:16,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:16,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:16,197 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:16,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 669332204, now seen corresponding path program 1 times [2025-04-29 10:52:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:16,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380104878] [2025-04-29 10:52:16,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:16,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:52:16,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:52:16,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:16,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:16,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:16,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:16,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380104878] [2025-04-29 10:52:16,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380104878] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:16,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:52:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995375908] [2025-04-29 10:52:16,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:16,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:52:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:16,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:52:16,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:52:16,351 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-29 10:52:16,353 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-04-29 10:52:16,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:16,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-29 10:52:16,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:16,454 INFO L116 PetriNetUnfolderBase]: 104/243 cut-off events. [2025-04-29 10:52:16,455 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 243 events. 104/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 923 event pairs, 67 based on Foata normal form. 22/222 useless extension candidates. Maximal degree in co-relation 423. Up to 185 conditions per place. [2025-04-29 10:52:16,459 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 21 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-04-29 10:52:16,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 109 flow [2025-04-29 10:52:16,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:52:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-29 10:52:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2025-04-29 10:52:16,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2025-04-29 10:52:16,473 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 2 states and 49 transitions. [2025-04-29 10:52:16,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 109 flow [2025-04-29 10:52:16,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:16,479 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 66 flow [2025-04-29 10:52:16,480 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-04-29 10:52:16,484 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2025-04-29 10:52:16,485 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 66 flow [2025-04-29 10:52:16,485 INFO L486 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-04-29 10:52:16,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:16,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:16,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:52:16,486 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:16,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash 669363021, now seen corresponding path program 1 times [2025-04-29 10:52:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:16,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446774107] [2025-04-29 10:52:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:16,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:52:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:52:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:16,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:16,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446774107] [2025-04-29 10:52:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446774107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:16,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:16,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986733560] [2025-04-29 10:52:16,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:16,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:16,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:16,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:16,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:16,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-29 10:52:16,747 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-04-29 10:52:16,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:16,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-29 10:52:16,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:16,931 INFO L116 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-04-29 10:52:16,931 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:16,932 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 28. Compared 1924 event pairs, 20 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 857. Up to 241 conditions per place. [2025-04-29 10:52:16,934 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-04-29 10:52:16,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 264 flow [2025-04-29 10:52:16,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-04-29 10:52:16,937 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-04-29 10:52:16,937 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 66 flow. Second operand 6 states and 112 transitions. [2025-04-29 10:52:16,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 264 flow [2025-04-29 10:52:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:16,940 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 168 flow [2025-04-29 10:52:16,941 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-04-29 10:52:16,941 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2025-04-29 10:52:16,941 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 168 flow [2025-04-29 10:52:16,941 INFO L486 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-04-29 10:52:16,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:16,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:16,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:52:16,943 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:16,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -724557734, now seen corresponding path program 1 times [2025-04-29 10:52:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:16,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442919680] [2025-04-29 10:52:16,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:16,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:16,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:52:16,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:52:16,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:16,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:17,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:17,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442919680] [2025-04-29 10:52:17,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442919680] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:17,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:17,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:17,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214183048] [2025-04-29 10:52:17,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:17,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:17,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:17,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:17,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:17,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:17,050 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-04-29 10:52:17,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:17,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:17,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:17,223 INFO L116 PetriNetUnfolderBase]: 279/560 cut-off events. [2025-04-29 10:52:17,223 INFO L117 PetriNetUnfolderBase]: For 191/193 co-relation queries the response was YES. [2025-04-29 10:52:17,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 560 events. 279/560 cut-off events. For 191/193 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2478 event pairs, 55 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1395. Up to 304 conditions per place. [2025-04-29 10:52:17,227 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-04-29 10:52:17,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 89 transitions, 474 flow [2025-04-29 10:52:17,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:17,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-04-29 10:52:17,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-04-29 10:52:17,228 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-04-29 10:52:17,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 89 transitions, 474 flow [2025-04-29 10:52:17,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:17,233 INFO L231 Difference]: Finished difference. Result has 52 places, 60 transitions, 366 flow [2025-04-29 10:52:17,233 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-04-29 10:52:17,233 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2025-04-29 10:52:17,233 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 60 transitions, 366 flow [2025-04-29 10:52:17,234 INFO L486 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-04-29 10:52:17,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:17,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:17,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:52:17,234 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:17,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1546425143, now seen corresponding path program 1 times [2025-04-29 10:52:17,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:17,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222857313] [2025-04-29 10:52:17,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:17,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:17,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:17,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:17,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:17,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:17,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222857313] [2025-04-29 10:52:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222857313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:17,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:17,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896831702] [2025-04-29 10:52:17,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:17,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:52:17,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:17,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:52:17,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:52:17,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-29 10:52:17,427 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-04-29 10:52:17,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:17,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-29 10:52:17,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:17,663 INFO L116 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-04-29 10:52:17,663 INFO L117 PetriNetUnfolderBase]: For 1261/1278 co-relation queries the response was YES. [2025-04-29 10:52:17,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 859 events. 399/859 cut-off events. For 1261/1278 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4778 event pairs, 86 based on Foata normal form. 16/820 useless extension candidates. Maximal degree in co-relation 2730. Up to 360 conditions per place. [2025-04-29 10:52:17,667 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-04-29 10:52:17,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 127 transitions, 942 flow [2025-04-29 10:52:17,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:52:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 10:52:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-04-29 10:52:17,669 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-04-29 10:52:17,669 INFO L175 Difference]: Start difference. First operand has 52 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-04-29 10:52:17,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 127 transitions, 942 flow [2025-04-29 10:52:17,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:17,684 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 588 flow [2025-04-29 10:52:17,684 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-04-29 10:52:17,684 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-04-29 10:52:17,684 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 588 flow [2025-04-29 10:52:17,684 INFO L486 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-04-29 10:52:17,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:17,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:17,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:52:17,685 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:17,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2145424759, now seen corresponding path program 2 times [2025-04-29 10:52:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:17,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868442965] [2025-04-29 10:52:17,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:52:17,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:17,693 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:17,705 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:17,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:52:17,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:18,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868442965] [2025-04-29 10:52:18,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868442965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 10:52:18,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456391009] [2025-04-29 10:52:18,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:18,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:52:18,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:18,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:52:18,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:52:18,015 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:18,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-04-29 10:52:18,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:18,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:18,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:18,375 INFO L116 PetriNetUnfolderBase]: 489/978 cut-off events. [2025-04-29 10:52:18,375 INFO L117 PetriNetUnfolderBase]: For 2054/2054 co-relation queries the response was YES. [2025-04-29 10:52:18,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 978 events. 489/978 cut-off events. For 2054/2054 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5105 event pairs, 119 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 3577. Up to 630 conditions per place. [2025-04-29 10:52:18,383 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 77 selfloop transitions, 67 changer transitions 0/150 dead transitions. [2025-04-29 10:52:18,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1398 flow [2025-04-29 10:52:18,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:52:18,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 10:52:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2025-04-29 10:52:18,386 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39293139293139295 [2025-04-29 10:52:18,386 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 588 flow. Second operand 13 states and 189 transitions. [2025-04-29 10:52:18,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1398 flow [2025-04-29 10:52:18,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 150 transitions, 1358 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 10:52:18,397 INFO L231 Difference]: Finished difference. Result has 77 places, 116 transitions, 1098 flow [2025-04-29 10:52:18,397 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=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1098, PETRI_PLACES=77, PETRI_TRANSITIONS=116} [2025-04-29 10:52:18,398 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2025-04-29 10:52:18,398 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 116 transitions, 1098 flow [2025-04-29 10:52:18,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 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-04-29 10:52:18,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:18,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:18,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:52:18,399 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:18,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1434022771, now seen corresponding path program 3 times [2025-04-29 10:52:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:18,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730458897] [2025-04-29 10:52:18,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:52:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:18,406 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:18,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:18,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 10:52:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:18,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:18,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:18,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730458897] [2025-04-29 10:52:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730458897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:18,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:18,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 10:52:18,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6522928] [2025-04-29 10:52:18,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:18,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:52:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:18,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:52:18,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:52:18,681 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-29 10:52:18,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 116 transitions, 1098 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-04-29 10:52:18,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-29 10:52:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:18,954 INFO L116 PetriNetUnfolderBase]: 468/966 cut-off events. [2025-04-29 10:52:18,954 INFO L117 PetriNetUnfolderBase]: For 2637/2665 co-relation queries the response was YES. [2025-04-29 10:52:18,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 966 events. 468/966 cut-off events. For 2637/2665 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5150 event pairs, 103 based on Foata normal form. 38/1001 useless extension candidates. Maximal degree in co-relation 3896. Up to 574 conditions per place. [2025-04-29 10:52:18,961 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 73 selfloop transitions, 74 changer transitions 0/158 dead transitions. [2025-04-29 10:52:18,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 158 transitions, 1666 flow [2025-04-29 10:52:18,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 10:52:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 10:52:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2025-04-29 10:52:18,964 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-04-29 10:52:18,964 INFO L175 Difference]: Start difference. First operand has 77 places, 116 transitions, 1098 flow. Second operand 9 states and 150 transitions. [2025-04-29 10:52:18,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 158 transitions, 1666 flow [2025-04-29 10:52:18,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1638 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:18,979 INFO L231 Difference]: Finished difference. Result has 89 places, 133 transitions, 1479 flow [2025-04-29 10:52:18,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1479, PETRI_PLACES=89, PETRI_TRANSITIONS=133} [2025-04-29 10:52:18,980 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 56 predicate places. [2025-04-29 10:52:18,981 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 133 transitions, 1479 flow [2025-04-29 10:52:18,981 INFO L486 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-04-29 10:52:18,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:18,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:18,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:52:18,982 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:18,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash -225705423, now seen corresponding path program 4 times [2025-04-29 10:52:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:18,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519608193] [2025-04-29 10:52:18,982 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:52:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:18,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-29 10:52:18,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-04-29 10:52:18,994 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:52:18,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:19,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:19,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519608193] [2025-04-29 10:52:19,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519608193] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:19,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:19,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:19,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534088038] [2025-04-29 10:52:19,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:19,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:19,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:19,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:19,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:19,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-29 10:52:19,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 133 transitions, 1479 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-04-29 10:52:19,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:19,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-29 10:52:19,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,293 INFO L116 PetriNetUnfolderBase]: 397/892 cut-off events. [2025-04-29 10:52:19,293 INFO L117 PetriNetUnfolderBase]: For 3260/3276 co-relation queries the response was YES. [2025-04-29 10:52:19,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 892 events. 397/892 cut-off events. For 3260/3276 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5011 event pairs, 5 based on Foata normal form. 42/932 useless extension candidates. Maximal degree in co-relation 3871. Up to 223 conditions per place. [2025-04-29 10:52:19,301 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 143 selfloop transitions, 47 changer transitions 0/214 dead transitions. [2025-04-29 10:52:19,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 214 transitions, 2351 flow [2025-04-29 10:52:19,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:19,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2025-04-29 10:52:19,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2025-04-29 10:52:19,303 INFO L175 Difference]: Start difference. First operand has 89 places, 133 transitions, 1479 flow. Second operand 6 states and 146 transitions. [2025-04-29 10:52:19,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 214 transitions, 2351 flow [2025-04-29 10:52:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 214 transitions, 2207 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-04-29 10:52:19,320 INFO L231 Difference]: Finished difference. Result has 93 places, 147 transitions, 1532 flow [2025-04-29 10:52:19,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1532, PETRI_PLACES=93, PETRI_TRANSITIONS=147} [2025-04-29 10:52:19,321 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 60 predicate places. [2025-04-29 10:52:19,321 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 147 transitions, 1532 flow [2025-04-29 10:52:19,321 INFO L486 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-04-29 10:52:19,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:52:19,321 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:19,322 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1907059387, now seen corresponding path program 5 times [2025-04-29 10:52:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290717762] [2025-04-29 10:52:19,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:52:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,330 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:19,335 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:19,335 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:52:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:19,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:19,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:19,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290717762] [2025-04-29 10:52:19,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290717762] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:19,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:19,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502749936] [2025-04-29 10:52:19,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:19,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:52:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:19,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:52:19,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:52:19,459 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-29 10:52:19,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 147 transitions, 1532 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-04-29 10:52:19,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:19,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-29 10:52:19,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:19,779 INFO L116 PetriNetUnfolderBase]: 633/1397 cut-off events. [2025-04-29 10:52:19,779 INFO L117 PetriNetUnfolderBase]: For 5829/5847 co-relation queries the response was YES. [2025-04-29 10:52:19,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6751 conditions, 1397 events. 633/1397 cut-off events. For 5829/5847 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8637 event pairs, 188 based on Foata normal form. 19/1405 useless extension candidates. Maximal degree in co-relation 6719. Up to 658 conditions per place. [2025-04-29 10:52:19,789 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 151 selfloop transitions, 52 changer transitions 0/222 dead transitions. [2025-04-29 10:52:19,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 222 transitions, 2536 flow [2025-04-29 10:52:19,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:52:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 10:52:19,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-04-29 10:52:19,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-04-29 10:52:19,790 INFO L175 Difference]: Start difference. First operand has 93 places, 147 transitions, 1532 flow. Second operand 7 states and 166 transitions. [2025-04-29 10:52:19,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 222 transitions, 2536 flow [2025-04-29 10:52:19,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 222 transitions, 2463 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-04-29 10:52:19,811 INFO L231 Difference]: Finished difference. Result has 99 places, 159 transitions, 1791 flow [2025-04-29 10:52:19,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1791, PETRI_PLACES=99, PETRI_TRANSITIONS=159} [2025-04-29 10:52:19,812 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2025-04-29 10:52:19,812 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 159 transitions, 1791 flow [2025-04-29 10:52:19,812 INFO L486 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-04-29 10:52:19,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:19,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:19,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 10:52:19,813 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:19,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash 61846721, now seen corresponding path program 6 times [2025-04-29 10:52:19,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:19,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518058789] [2025-04-29 10:52:19,813 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:52:19,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:19,819 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:19,824 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:19,824 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 10:52:19,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:20,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518058789] [2025-04-29 10:52:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518058789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:20,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-29 10:52:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914232556] [2025-04-29 10:52:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:20,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:52:20,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:20,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:52:20,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:52:20,054 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-29 10:52:20,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 159 transitions, 1791 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-04-29 10:52:20,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:20,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-29 10:52:20,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:20,398 INFO L116 PetriNetUnfolderBase]: 599/1279 cut-off events. [2025-04-29 10:52:20,399 INFO L117 PetriNetUnfolderBase]: For 5657/5694 co-relation queries the response was YES. [2025-04-29 10:52:20,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6232 conditions, 1279 events. 599/1279 cut-off events. For 5657/5694 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7392 event pairs, 180 based on Foata normal form. 39/1302 useless extension candidates. Maximal degree in co-relation 6199. Up to 898 conditions per place. [2025-04-29 10:52:20,408 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 102 selfloop transitions, 52 changer transitions 0/165 dead transitions. [2025-04-29 10:52:20,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 165 transitions, 1890 flow [2025-04-29 10:52:20,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:52:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 10:52:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2025-04-29 10:52:20,410 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4189189189189189 [2025-04-29 10:52:20,410 INFO L175 Difference]: Start difference. First operand has 99 places, 159 transitions, 1791 flow. Second operand 12 states and 186 transitions. [2025-04-29 10:52:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 165 transitions, 1890 flow [2025-04-29 10:52:20,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 165 transitions, 1786 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-29 10:52:20,425 INFO L231 Difference]: Finished difference. Result has 107 places, 140 transitions, 1493 flow [2025-04-29 10:52:20,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1493, PETRI_PLACES=107, PETRI_TRANSITIONS=140} [2025-04-29 10:52:20,426 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 74 predicate places. [2025-04-29 10:52:20,426 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 140 transitions, 1493 flow [2025-04-29 10:52:20,426 INFO L486 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-04-29 10:52:20,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:20,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:20,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:52:20,426 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:20,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1639087735, now seen corresponding path program 7 times [2025-04-29 10:52:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:20,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7461952] [2025-04-29 10:52:20,428 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 10:52:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:20,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 10:52:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 10:52:20,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:20,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:20,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:20,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7461952] [2025-04-29 10:52:20,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7461952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:20,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:20,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:20,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829299900] [2025-04-29 10:52:20,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:20,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:52:20,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:20,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:52:20,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:52:20,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-29 10:52:20,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 140 transitions, 1493 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-04-29 10:52:20,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:20,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-29 10:52:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:20,860 INFO L116 PetriNetUnfolderBase]: 741/1658 cut-off events. [2025-04-29 10:52:20,861 INFO L117 PetriNetUnfolderBase]: For 7120/7138 co-relation queries the response was YES. [2025-04-29 10:52:20,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7885 conditions, 1658 events. 741/1658 cut-off events. For 7120/7138 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9736 event pairs, 227 based on Foata normal form. 23/1677 useless extension candidates. Maximal degree in co-relation 7851. Up to 564 conditions per place. [2025-04-29 10:52:20,872 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 183 selfloop transitions, 33 changer transitions 0/233 dead transitions. [2025-04-29 10:52:20,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 233 transitions, 2630 flow [2025-04-29 10:52:20,873 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:52:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 10:52:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions. [2025-04-29 10:52:20,874 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.640926640926641 [2025-04-29 10:52:20,874 INFO L175 Difference]: Start difference. First operand has 107 places, 140 transitions, 1493 flow. Second operand 7 states and 166 transitions. [2025-04-29 10:52:20,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 233 transitions, 2630 flow [2025-04-29 10:52:20,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 233 transitions, 2507 flow, removed 7 selfloop flow, removed 9 redundant places. [2025-04-29 10:52:20,894 INFO L231 Difference]: Finished difference. Result has 107 places, 152 transitions, 1643 flow [2025-04-29 10:52:20,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1378, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1643, PETRI_PLACES=107, PETRI_TRANSITIONS=152} [2025-04-29 10:52:20,895 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 74 predicate places. [2025-04-29 10:52:20,895 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 152 transitions, 1643 flow [2025-04-29 10:52:20,895 INFO L486 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-04-29 10:52:20,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:20,895 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:20,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 10:52:20,896 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:20,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:20,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1310197319, now seen corresponding path program 1 times [2025-04-29 10:52:20,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:20,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990522199] [2025-04-29 10:52:20,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:20,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:52:20,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:52:20,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:20,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:21,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:21,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990522199] [2025-04-29 10:52:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990522199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:21,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:21,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 10:52:21,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495127746] [2025-04-29 10:52:21,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:21,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:52:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:21,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:52:21,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:52:21,130 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-04-29 10:52:21,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 152 transitions, 1643 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-04-29 10:52:21,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:21,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-04-29 10:52:21,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:21,719 INFO L116 PetriNetUnfolderBase]: 1630/3365 cut-off events. [2025-04-29 10:52:21,719 INFO L117 PetriNetUnfolderBase]: For 16037/16189 co-relation queries the response was YES. [2025-04-29 10:52:21,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16284 conditions, 3365 events. 1630/3365 cut-off events. For 16037/16189 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 20911 event pairs, 374 based on Foata normal form. 203/3535 useless extension candidates. Maximal degree in co-relation 16249. Up to 1357 conditions per place. [2025-04-29 10:52:21,737 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 246 selfloop transitions, 168 changer transitions 0/426 dead transitions. [2025-04-29 10:52:21,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 426 transitions, 4840 flow [2025-04-29 10:52:21,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 10:52:21,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 10:52:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 302 transitions. [2025-04-29 10:52:21,739 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5441441441441441 [2025-04-29 10:52:21,739 INFO L175 Difference]: Start difference. First operand has 107 places, 152 transitions, 1643 flow. Second operand 15 states and 302 transitions. [2025-04-29 10:52:21,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 426 transitions, 4840 flow [2025-04-29 10:52:21,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 426 transitions, 4733 flow, removed 34 selfloop flow, removed 3 redundant places. [2025-04-29 10:52:21,766 INFO L231 Difference]: Finished difference. Result has 132 places, 292 transitions, 3741 flow [2025-04-29 10:52:21,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3741, PETRI_PLACES=132, PETRI_TRANSITIONS=292} [2025-04-29 10:52:21,767 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places. [2025-04-29 10:52:21,767 INFO L485 AbstractCegarLoop]: Abstraction has has 132 places, 292 transitions, 3741 flow [2025-04-29 10:52:21,767 INFO L486 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-04-29 10:52:21,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:21,767 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:21,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 10:52:21,767 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:21,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:21,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1011887721, now seen corresponding path program 2 times [2025-04-29 10:52:21,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:21,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636691029] [2025-04-29 10:52:21,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:52:21,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:21,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-29 10:52:21,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-04-29 10:52:21,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:52:21,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:21,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:21,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636691029] [2025-04-29 10:52:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636691029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:21,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:21,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 10:52:21,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348770553] [2025-04-29 10:52:21,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:21,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:52:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:21,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:52:21,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:52:21,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:21,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 292 transitions, 3741 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-04-29 10:52:21,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:21,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:21,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:22,660 INFO L116 PetriNetUnfolderBase]: 2096/4261 cut-off events. [2025-04-29 10:52:22,661 INFO L117 PetriNetUnfolderBase]: For 36302/36334 co-relation queries the response was YES. [2025-04-29 10:52:22,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25003 conditions, 4261 events. 2096/4261 cut-off events. For 36302/36334 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 27321 event pairs, 270 based on Foata normal form. 46/4300 useless extension candidates. Maximal degree in co-relation 24955. Up to 1438 conditions per place. [2025-04-29 10:52:22,731 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 305 selfloop transitions, 265 changer transitions 0/576 dead transitions. [2025-04-29 10:52:22,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 576 transitions, 8204 flow [2025-04-29 10:52:22,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:52:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 10:52:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 222 transitions. [2025-04-29 10:52:22,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-29 10:52:22,733 INFO L175 Difference]: Start difference. First operand has 132 places, 292 transitions, 3741 flow. Second operand 14 states and 222 transitions. [2025-04-29 10:52:22,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 576 transitions, 8204 flow [2025-04-29 10:52:22,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 576 transitions, 8092 flow, removed 56 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:22,841 INFO L231 Difference]: Finished difference. Result has 157 places, 471 transitions, 7233 flow [2025-04-29 10:52:22,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3693, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7233, PETRI_PLACES=157, PETRI_TRANSITIONS=471} [2025-04-29 10:52:22,842 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 124 predicate places. [2025-04-29 10:52:22,842 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 471 transitions, 7233 flow [2025-04-29 10:52:22,842 INFO L486 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-04-29 10:52:22,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:22,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:22,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 10:52:22,842 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:22,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:22,843 INFO L85 PathProgramCache]: Analyzing trace with hash 799208017, now seen corresponding path program 3 times [2025-04-29 10:52:22,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:22,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042306860] [2025-04-29 10:52:22,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:52:22,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:22,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-29 10:52:22,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 20 statements. [2025-04-29 10:52:22,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 10:52:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:22,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042306860] [2025-04-29 10:52:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042306860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 10:52:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508645890] [2025-04-29 10:52:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:22,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 10:52:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:22,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 10:52:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 10:52:23,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:23,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 471 transitions, 7233 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-04-29 10:52:23,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:23,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:23,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:24,075 INFO L116 PetriNetUnfolderBase]: 2191/4469 cut-off events. [2025-04-29 10:52:24,075 INFO L117 PetriNetUnfolderBase]: For 55269/55273 co-relation queries the response was YES. [2025-04-29 10:52:24,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30130 conditions, 4469 events. 2191/4469 cut-off events. For 55269/55273 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 28854 event pairs, 121 based on Foata normal form. 24/4492 useless extension candidates. Maximal degree in co-relation 30070. Up to 1030 conditions per place. [2025-04-29 10:52:24,112 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 249 selfloop transitions, 427 changer transitions 0/682 dead transitions. [2025-04-29 10:52:24,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 682 transitions, 11221 flow [2025-04-29 10:52:24,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 10:52:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 10:52:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2025-04-29 10:52:24,117 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4165341812400636 [2025-04-29 10:52:24,117 INFO L175 Difference]: Start difference. First operand has 157 places, 471 transitions, 7233 flow. Second operand 17 states and 262 transitions. [2025-04-29 10:52:24,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 682 transitions, 11221 flow [2025-04-29 10:52:24,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 682 transitions, 10949 flow, removed 136 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:24,416 INFO L231 Difference]: Finished difference. Result has 183 places, 602 transitions, 10481 flow [2025-04-29 10:52:24,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7013, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=10481, PETRI_PLACES=183, PETRI_TRANSITIONS=602} [2025-04-29 10:52:24,418 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 150 predicate places. [2025-04-29 10:52:24,418 INFO L485 AbstractCegarLoop]: Abstraction has has 183 places, 602 transitions, 10481 flow [2025-04-29 10:52:24,418 INFO L486 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-04-29 10:52:24,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:24,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:24,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 10:52:24,418 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:24,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1759875005, now seen corresponding path program 4 times [2025-04-29 10:52:24,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:24,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070893741] [2025-04-29 10:52:24,419 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:52:24,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:24,426 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-29 10:52:24,428 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-04-29 10:52:24,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:52:24,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:24,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:24,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:24,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070893741] [2025-04-29 10:52:24,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070893741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:24,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:24,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:52:24,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758309273] [2025-04-29 10:52:24,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:24,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:24,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:24,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:24,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:24,481 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-29 10:52:24,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 602 transitions, 10481 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:24,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:24,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-29 10:52:24,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:25,501 INFO L116 PetriNetUnfolderBase]: 2059/4379 cut-off events. [2025-04-29 10:52:25,502 INFO L117 PetriNetUnfolderBase]: For 65644/65788 co-relation queries the response was YES. [2025-04-29 10:52:25,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32060 conditions, 4379 events. 2059/4379 cut-off events. For 65644/65788 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29840 event pairs, 199 based on Foata normal form. 93/4426 useless extension candidates. Maximal degree in co-relation 31990. Up to 1536 conditions per place. [2025-04-29 10:52:25,549 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 533 selfloop transitions, 149 changer transitions 0/761 dead transitions. [2025-04-29 10:52:25,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 761 transitions, 14377 flow [2025-04-29 10:52:25,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:25,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-04-29 10:52:25,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-04-29 10:52:25,550 INFO L175 Difference]: Start difference. First operand has 183 places, 602 transitions, 10481 flow. Second operand 5 states and 110 transitions. [2025-04-29 10:52:25,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 761 transitions, 14377 flow [2025-04-29 10:52:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 761 transitions, 14051 flow, removed 141 selfloop flow, removed 2 redundant places. [2025-04-29 10:52:25,962 INFO L231 Difference]: Finished difference. Result has 187 places, 612 transitions, 10686 flow [2025-04-29 10:52:25,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10251, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=10686, PETRI_PLACES=187, PETRI_TRANSITIONS=612} [2025-04-29 10:52:25,962 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 154 predicate places. [2025-04-29 10:52:25,962 INFO L485 AbstractCegarLoop]: Abstraction has has 187 places, 612 transitions, 10686 flow [2025-04-29 10:52:25,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:25,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:25,963 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:25,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 10:52:25,963 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:25,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1885056637, now seen corresponding path program 1 times [2025-04-29 10:52:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:25,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116169725] [2025-04-29 10:52:25,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:25,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:25,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:52:25,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:52:25,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:25,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:26,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116169725] [2025-04-29 10:52:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116169725] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:26,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368378993] [2025-04-29 10:52:26,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:26,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:26,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:26,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:26,023 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-29 10:52:26,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 612 transitions, 10686 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-04-29 10:52:26,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:26,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-29 10:52:26,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:26,855 INFO L116 PetriNetUnfolderBase]: 2063/4341 cut-off events. [2025-04-29 10:52:26,856 INFO L117 PetriNetUnfolderBase]: For 64109/64195 co-relation queries the response was YES. [2025-04-29 10:52:26,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32877 conditions, 4341 events. 2063/4341 cut-off events. For 64109/64195 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 29189 event pairs, 430 based on Foata normal form. 14/4322 useless extension candidates. Maximal degree in co-relation 32805. Up to 3697 conditions per place. [2025-04-29 10:52:26,885 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 492 selfloop transitions, 8 changer transitions 29/587 dead transitions. [2025-04-29 10:52:26,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 587 transitions, 11130 flow [2025-04-29 10:52:26,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:52:26,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 10:52:26,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-29 10:52:26,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-04-29 10:52:26,887 INFO L175 Difference]: Start difference. First operand has 187 places, 612 transitions, 10686 flow. Second operand 5 states and 95 transitions. [2025-04-29 10:52:26,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 587 transitions, 11130 flow [2025-04-29 10:52:27,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 587 transitions, 10820 flow, removed 93 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:27,205 INFO L231 Difference]: Finished difference. Result has 192 places, 557 transitions, 9304 flow [2025-04-29 10:52:27,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9705, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=9304, PETRI_PLACES=192, PETRI_TRANSITIONS=557} [2025-04-29 10:52:27,206 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 159 predicate places. [2025-04-29 10:52:27,206 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 557 transitions, 9304 flow [2025-04-29 10:52:27,206 INFO L486 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-04-29 10:52:27,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:27,207 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:27,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 10:52:27,207 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:27,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash -722594494, now seen corresponding path program 5 times [2025-04-29 10:52:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:27,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28810180] [2025-04-29 10:52:27,207 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:52:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:27,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 10:52:27,221 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:52:27,221 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:52:27,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:27,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:27,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28810180] [2025-04-29 10:52:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28810180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:52:27,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57498793] [2025-04-29 10:52:27,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:52:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:52:27,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:27,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:52:27,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 10:52:27,619 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-29 10:52:27,638 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-29 10:52:27,638 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:52:27,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:27,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 10:52:27,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:52:27,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-04-29 10:52:27,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-29 10:52:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:27,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:52:27,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57498793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:52:27,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 19 [2025-04-29 10:52:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878199920] [2025-04-29 10:52:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:27,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 10:52:27,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:27,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 10:52:27,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2025-04-29 10:52:27,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-04-29 10:52:27,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 557 transitions, 9304 flow. Second operand has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-04-29 10:52:27,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:27,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-04-29 10:52:27,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:29,241 INFO L116 PetriNetUnfolderBase]: 2746/5739 cut-off events. [2025-04-29 10:52:29,241 INFO L117 PetriNetUnfolderBase]: For 86408/86522 co-relation queries the response was YES. [2025-04-29 10:52:29,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42856 conditions, 5739 events. 2746/5739 cut-off events. For 86408/86522 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 40891 event pairs, 322 based on Foata normal form. 61/5761 useless extension candidates. Maximal degree in co-relation 42782. Up to 1952 conditions per place. [2025-04-29 10:52:29,280 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 392 selfloop transitions, 325 changer transitions 0/773 dead transitions. [2025-04-29 10:52:29,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 773 transitions, 13793 flow [2025-04-29 10:52:29,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:52:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 10:52:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 235 transitions. [2025-04-29 10:52:29,282 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45366795366795365 [2025-04-29 10:52:29,282 INFO L175 Difference]: Start difference. First operand has 192 places, 557 transitions, 9304 flow. Second operand 14 states and 235 transitions. [2025-04-29 10:52:29,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 773 transitions, 13793 flow [2025-04-29 10:52:29,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 773 transitions, 13523 flow, removed 48 selfloop flow, removed 18 redundant places. [2025-04-29 10:52:29,675 INFO L231 Difference]: Finished difference. Result has 185 places, 696 transitions, 12313 flow [2025-04-29 10:52:29,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=9070, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=12313, PETRI_PLACES=185, PETRI_TRANSITIONS=696} [2025-04-29 10:52:29,676 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places. [2025-04-29 10:52:29,676 INFO L485 AbstractCegarLoop]: Abstraction has has 185 places, 696 transitions, 12313 flow [2025-04-29 10:52:29,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 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-04-29 10:52:29,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:29,676 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:29,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:52:29,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 10:52:29,877 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:29,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:29,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1711774988, now seen corresponding path program 6 times [2025-04-29 10:52:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:29,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887521575] [2025-04-29 10:52:29,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:52:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:29,885 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-29 10:52:29,889 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 20 of 25 statements. [2025-04-29 10:52:29,890 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-29 10:52:29,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:30,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:30,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887521575] [2025-04-29 10:52:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887521575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:30,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:30,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 10:52:30,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949892] [2025-04-29 10:52:30,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:30,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 10:52:30,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:30,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 10:52:30,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 10:52:30,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:30,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 696 transitions, 12313 flow. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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-04-29 10:52:30,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:30,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:30,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:31,685 INFO L116 PetriNetUnfolderBase]: 2934/5936 cut-off events. [2025-04-29 10:52:31,685 INFO L117 PetriNetUnfolderBase]: For 89567/89649 co-relation queries the response was YES. [2025-04-29 10:52:31,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46510 conditions, 5936 events. 2934/5936 cut-off events. For 89567/89649 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 40793 event pairs, 154 based on Foata normal form. 36/5949 useless extension candidates. Maximal degree in co-relation 46439. Up to 1438 conditions per place. [2025-04-29 10:52:31,810 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 206 selfloop transitions, 558 changer transitions 0/769 dead transitions. [2025-04-29 10:52:31,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 769 transitions, 14731 flow [2025-04-29 10:52:31,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 10:52:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 10:52:31,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2025-04-29 10:52:31,811 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3471933471933472 [2025-04-29 10:52:31,811 INFO L175 Difference]: Start difference. First operand has 185 places, 696 transitions, 12313 flow. Second operand 13 states and 167 transitions. [2025-04-29 10:52:31,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 769 transitions, 14731 flow [2025-04-29 10:52:32,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 769 transitions, 13776 flow, removed 133 selfloop flow, removed 14 redundant places. [2025-04-29 10:52:32,304 INFO L231 Difference]: Finished difference. Result has 181 places, 716 transitions, 12876 flow [2025-04-29 10:52:32,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11354, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=536, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12876, PETRI_PLACES=181, PETRI_TRANSITIONS=716} [2025-04-29 10:52:32,304 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 148 predicate places. [2025-04-29 10:52:32,304 INFO L485 AbstractCegarLoop]: Abstraction has has 181 places, 716 transitions, 12876 flow [2025-04-29 10:52:32,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 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-04-29 10:52:32,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:32,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:32,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 10:52:32,305 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:32,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1913450759, now seen corresponding path program 1 times [2025-04-29 10:52:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:32,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135281647] [2025-04-29 10:52:32,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:32,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:52:32,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:52:32,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:32,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:32,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:32,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135281647] [2025-04-29 10:52:32,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135281647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:52:32,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171844511] [2025-04-29 10:52:32,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:32,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:52:32,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:32,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:52:32,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 10:52:32,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 10:52:32,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 10:52:32,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:32,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:32,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-29 10:52:32,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:52:32,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-29 10:52:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:32,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:52:32,894 INFO L325 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-04-29 10:52:32,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2025-04-29 10:52:32,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:32,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171844511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:52:32,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:52:32,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-04-29 10:52:32,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826963794] [2025-04-29 10:52:32,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:52:32,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:52:32,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:32,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:52:32,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:52:32,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-04-29 10:52:32,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 716 transitions, 12876 flow. Second operand has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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-04-29 10:52:32,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:32,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-04-29 10:52:32,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:34,435 INFO L116 PetriNetUnfolderBase]: 3045/6150 cut-off events. [2025-04-29 10:52:34,435 INFO L117 PetriNetUnfolderBase]: For 87157/87221 co-relation queries the response was YES. [2025-04-29 10:52:34,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48883 conditions, 6150 events. 3045/6150 cut-off events. For 87157/87221 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 42505 event pairs, 244 based on Foata normal form. 60/6187 useless extension candidates. Maximal degree in co-relation 48824. Up to 2099 conditions per place. [2025-04-29 10:52:34,479 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 435 selfloop transitions, 452 changer transitions 9/901 dead transitions. [2025-04-29 10:52:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 901 transitions, 17396 flow [2025-04-29 10:52:34,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:52:34,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 10:52:34,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 201 transitions. [2025-04-29 10:52:34,480 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38803088803088803 [2025-04-29 10:52:34,480 INFO L175 Difference]: Start difference. First operand has 181 places, 716 transitions, 12876 flow. Second operand 14 states and 201 transitions. [2025-04-29 10:52:34,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 901 transitions, 17396 flow [2025-04-29 10:52:34,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 901 transitions, 17022 flow, removed 49 selfloop flow, removed 3 redundant places. [2025-04-29 10:52:34,902 INFO L231 Difference]: Finished difference. Result has 194 places, 763 transitions, 14537 flow [2025-04-29 10:52:34,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12559, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=405, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14537, PETRI_PLACES=194, PETRI_TRANSITIONS=763} [2025-04-29 10:52:34,902 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 161 predicate places. [2025-04-29 10:52:34,902 INFO L485 AbstractCegarLoop]: Abstraction has has 194 places, 763 transitions, 14537 flow [2025-04-29 10:52:34,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.304347826086957) internal successors, (214), 23 states have internal predecessors, (214), 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-04-29 10:52:34,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:34,903 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:34,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 10:52:35,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 10:52:35,103 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-29 10:52:35,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -50195854, now seen corresponding path program 1 times [2025-04-29 10:52:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:35,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287226086] [2025-04-29 10:52:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:35,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:52:35,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:52:35,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:35,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:35,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:35,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287226086] [2025-04-29 10:52:35,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287226086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:52:35,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046983042] [2025-04-29 10:52:35,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:35,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:52:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:35,336 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 10:52:35,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 10:52:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:52:35,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:52:35,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:35,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:35,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-29 10:52:35,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:52:35,459 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 10:52:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:35,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:52:35,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2025-04-29 10:52:35,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 10:52:35,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046983042] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 10:52:35,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 10:52:35,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 5] total 16 [2025-04-29 10:52:35,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659671069] [2025-04-29 10:52:35,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:35,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:35,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:35,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:35,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:52:35,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-04-29 10:52:35,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 763 transitions, 14537 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:35,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:35,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-04-29 10:52:35,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:35,886 INFO L116 PetriNetUnfolderBase]: 673/1627 cut-off events. [2025-04-29 10:52:35,886 INFO L117 PetriNetUnfolderBase]: For 34176/34236 co-relation queries the response was YES. [2025-04-29 10:52:35,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13830 conditions, 1627 events. 673/1627 cut-off events. For 34176/34236 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9322 event pairs, 76 based on Foata normal form. 85/1701 useless extension candidates. Maximal degree in co-relation 13768. Up to 580 conditions per place. [2025-04-29 10:52:35,897 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 0 selfloop transitions, 0 changer transitions 448/448 dead transitions. [2025-04-29 10:52:35,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 448 transitions, 9807 flow [2025-04-29 10:52:35,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:52:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:52:35,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-04-29 10:52:35,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-04-29 10:52:35,898 INFO L175 Difference]: Start difference. First operand has 194 places, 763 transitions, 14537 flow. Second operand 6 states and 126 transitions. [2025-04-29 10:52:35,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 448 transitions, 9807 flow [2025-04-29 10:52:35,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 448 transitions, 7773 flow, removed 100 selfloop flow, removed 40 redundant places. [2025-04-29 10:52:35,977 INFO L231 Difference]: Finished difference. Result has 150 places, 0 transitions, 0 flow [2025-04-29 10:52:35,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6633, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=150, PETRI_TRANSITIONS=0} [2025-04-29 10:52:35,977 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 117 predicate places. [2025-04-29 10:52:35,977 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 0 transitions, 0 flow [2025-04-29 10:52:35,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:35,979 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-29 10:52:35,979 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-29 10:52:35,979 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-29 10:52:35,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-29 10:52:35,980 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-29 10:52:35,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 10:52:36,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:52:36,180 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:36,184 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:52:36,184 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:52:36,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:52:36 BasicIcfg [2025-04-29 10:52:36,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:52:36,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:52:36,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:52:36,187 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:52:36,187 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:16" (3/4) ... [2025-04-29 10:52:36,188 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:52:36,190 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure worker [2025-04-29 10:52:36,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-04-29 10:52:36,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-04-29 10:52:36,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:52:36,192 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 10:52:36,244 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:52:36,245 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:52:36,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:52:36,246 INFO L158 Benchmark]: Toolchain (without parser) took 20843.51ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 123.2MB in the beginning and 660.8MB in the end (delta: -537.5MB). Peak memory consumption was 490.2MB. Max. memory is 16.1GB. [2025-04-29 10:52:36,246 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:36,246 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.81ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 108.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:52:36,246 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:36,247 INFO L158 Benchmark]: Boogie Preprocessor took 32.03ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:36,247 INFO L158 Benchmark]: RCFGBuilder took 379.34ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 78.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 10:52:36,247 INFO L158 Benchmark]: TraceAbstraction took 20125.02ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 77.7MB in the beginning and 665.2MB in the end (delta: -587.4MB). Peak memory consumption was 930.6MB. Max. memory is 16.1GB. [2025-04-29 10:52:36,247 INFO L158 Benchmark]: Witness Printer took 57.94ms. Allocated memory is still 1.2GB. Free memory was 665.2MB in the beginning and 660.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:36,248 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.81ms. Allocated memory is still 167.8MB. Free memory was 123.2MB in the beginning and 108.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 107.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.03ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 379.34ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 78.2MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20125.02ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 77.7MB in the beginning and 665.2MB in the end (delta: -587.4MB). Peak memory consumption was 930.6MB. Max. memory is 16.1GB. * Witness Printer took 57.94ms. Allocated memory is still 1.2GB. Free memory was 665.2MB in the beginning and 660.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 65 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.1s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1377 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1340 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 337 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4940 IncrementalHoareTripleChecker+Invalid, 5049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 39 mSDtfsCounter, 4940 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 391 GetRequests, 173 SyntacticMatches, 3 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14537occurred in iteration=18, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 422 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 3235 SizeOfPredicates, 45 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 17/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 10:52:36,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE