./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-lit/sssc12.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/sssc12.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:31:35,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:31:36,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:31:36,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:31:36,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:31:36,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:31:36,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:31:36,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:31:36,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:31:36,073 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:31:36,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:31:36,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:31:36,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:31:36,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:31:36,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:36,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:36,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:31:36,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:31:36,076 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94001a9ab0492f7774a7e81f183179cf0060947b701e48f51b2989eec22ae051 [2025-01-09 16:31:36,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:31:36,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:31:36,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:31:36,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:31:36,406 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:31:36,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/sssc12.i [2025-01-09 16:31:37,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bab00a8dd/b077a86fda6c4c0783fe9a329c812181/FLAG22e212874 [2025-01-09 16:31:38,008 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:31:38,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i [2025-01-09 16:31:38,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bab00a8dd/b077a86fda6c4c0783fe9a329c812181/FLAG22e212874 [2025-01-09 16:31:38,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bab00a8dd/b077a86fda6c4c0783fe9a329c812181 [2025-01-09 16:31:38,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:31:38,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:31:38,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:38,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:31:38,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:31:38,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7306bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38, skipping insertion in model container [2025-01-09 16:31:38,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:31:38,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i[47777,47790] [2025-01-09 16:31:38,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:38,587 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:31:38,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-lit/sssc12.i[47777,47790] [2025-01-09 16:31:38,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:38,684 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:31:38,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38 WrapperNode [2025-01-09 16:31:38,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:38,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:38,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:31:38,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:31:38,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,723 INFO L138 Inliner]: procedures = 272, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-01-09 16:31:38,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:38,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:31:38,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:31:38,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:31:38,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,737 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,756 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 5, 1]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-01-09 16:31:38,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,777 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:31:38,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:31:38,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:31:38,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:31:38,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (1/1) ... [2025-01-09 16:31:38,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:38,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:31:38,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:31:38,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:31:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-01-09 16:31:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-01-09 16:31:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:31:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:31:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:31:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:31:38,846 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:31:38,959 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:31:38,960 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:31:39,060 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:31:39,060 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:31:39,138 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:31:39,139 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 16:31:39,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:39 BoogieIcfgContainer [2025-01-09 16:31:39,140 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:31:39,142 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:31:39,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:31:39,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:31:39,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:31:38" (1/3) ... [2025-01-09 16:31:39,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f414a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:39, skipping insertion in model container [2025-01-09 16:31:39,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:38" (2/3) ... [2025-01-09 16:31:39,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62f414a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:39, skipping insertion in model container [2025-01-09 16:31:39,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:39" (3/3) ... [2025-01-09 16:31:39,147 INFO L128 eAbstractionObserver]: Analyzing ICFG sssc12.i [2025-01-09 16:31:39,157 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:31:39,158 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sssc12.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 16:31:39,159 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:31:39,189 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:31:39,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 18 transitions, 40 flow [2025-01-09 16:31:39,229 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-01-09 16:31:39,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:31:39,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-01-09 16:31:39,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 18 transitions, 40 flow [2025-01-09 16:31:39,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 18 transitions, 40 flow [2025-01-09 16:31:39,238 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:39,245 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@361aac69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:39,245 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:31:39,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:39,249 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-09 16:31:39,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:31:39,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:39,250 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-09 16:31:39,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 16:31:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1791545031, now seen corresponding path program 1 times [2025-01-09 16:31:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563633217] [2025-01-09 16:31:39,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:39,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:31:39,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:31:39,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:39,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:39,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:31:39,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 16:31:39,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 16:31:39,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:39,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:39,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:31:39,367 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:31:39,368 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-01-09 16:31:39,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-01-09 16:31:39,369 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-01-09 16:31:39,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:31:39,370 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:31:39,372 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:31:39,372 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 16:31:39,385 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:31:39,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 72 flow [2025-01-09 16:31:39,395 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-01-09 16:31:39,395 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:31:39,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 36 events. 4/36 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 3 conditions per place. [2025-01-09 16:31:39,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 72 flow [2025-01-09 16:31:39,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 31 transitions, 72 flow [2025-01-09 16:31:39,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:39,397 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@361aac69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:39,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:31:39,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:39,402 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-01-09 16:31:39,402 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:31:39,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:39,402 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-09 16:31:39,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-01-09 16:31:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1076068534, now seen corresponding path program 1 times [2025-01-09 16:31:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166227241] [2025-01-09 16:31:39,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:39,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:31:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:31:39,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:39,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:39,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:31:39,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 16:31:39,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 16:31:39,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:39,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:39,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:31:39,436 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:31:39,436 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-01-09 16:31:39,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-01-09 16:31:39,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-01-09 16:31:39,436 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-01-09 16:31:39,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:31:39,436 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-01-09 16:31:39,437 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:31:39,437 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 16:31:39,453 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:31:39,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 106 flow [2025-01-09 16:31:39,474 INFO L124 PetriNetUnfolderBase]: 6/52 cut-off events. [2025-01-09 16:31:39,475 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:31:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 52 events. 6/52 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 112 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2025-01-09 16:31:39,476 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 106 flow [2025-01-09 16:31:39,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 44 transitions, 106 flow [2025-01-09 16:31:39,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:39,478 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@361aac69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:39,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-01-09 16:31:39,484 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:39,484 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-09 16:31:39,485 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 16:31:39,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:39,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:39,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:31:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash -10011979, now seen corresponding path program 1 times [2025-01-09 16:31:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:39,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743923224] [2025-01-09 16:31:39,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:39,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:31:39,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:31:39,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:39,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:39,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:39,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743923224] [2025-01-09 16:31:39,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743923224] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:39,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:39,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:39,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245155924] [2025-01-09 16:31:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:39,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:39,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:39,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2025-01-09 16:31:39,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:39,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:39,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2025-01-09 16:31:39,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:41,061 INFO L124 PetriNetUnfolderBase]: 8697/13361 cut-off events. [2025-01-09 16:31:41,061 INFO L125 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2025-01-09 16:31:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25692 conditions, 13361 events. 8697/13361 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 85652 event pairs, 1822 based on Foata normal form. 963/11918 useless extension candidates. Maximal degree in co-relation 17521. Up to 6186 conditions per place. [2025-01-09 16:31:41,141 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 101 selfloop transitions, 12 changer transitions 0/124 dead transitions. [2025-01-09 16:31:41,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 552 flow [2025-01-09 16:31:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:31:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:31:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 206 transitions. [2025-01-09 16:31:41,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6688311688311688 [2025-01-09 16:31:41,155 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 106 flow. Second operand 7 states and 206 transitions. [2025-01-09 16:31:41,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 552 flow [2025-01-09 16:31:41,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 540 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-09 16:31:41,165 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 180 flow [2025-01-09 16:31:41,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2025-01-09 16:31:41,169 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places. [2025-01-09 16:31:41,169 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 180 flow [2025-01-09 16:31:41,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:41,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:41,170 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-09 16:31:41,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:31:41,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-01-09 16:31:41,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1943723750, now seen corresponding path program 1 times [2025-01-09 16:31:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:41,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513502507] [2025-01-09 16:31:41,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:41,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:31:41,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:31:41,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:41,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:41,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 16:31:41,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 16:31:41,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 16:31:41,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:41,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 16:31:41,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 16:31:41,218 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 16:31:41,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-01-09 16:31:41,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-01-09 16:31:41,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-01-09 16:31:41,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-01-09 16:31:41,219 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-01-09 16:31:41,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:31:41,219 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 16:31:41,220 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 16:31:41,220 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 16:31:41,253 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:31:41,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 57 transitions, 142 flow [2025-01-09 16:31:41,262 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2025-01-09 16:31:41,262 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 16:31:41,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 68 events. 8/68 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 159 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 64. Up to 5 conditions per place. [2025-01-09 16:31:41,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 57 transitions, 142 flow [2025-01-09 16:31:41,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 142 flow [2025-01-09 16:31:41,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:41,265 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@361aac69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:41,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-09 16:31:41,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:41,267 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-01-09 16:31:41,267 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-01-09 16:31:41,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:41,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:41,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:31:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash -838365350, now seen corresponding path program 1 times [2025-01-09 16:31:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561477072] [2025-01-09 16:31:41,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:41,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:31:41,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:31:41,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:41,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561477072] [2025-01-09 16:31:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561477072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037434787] [2025-01-09 16:31:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:41,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-01-09 16:31:41,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:41,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:41,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-01-09 16:31:41,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:48,440 INFO L124 PetriNetUnfolderBase]: 98531/139216 cut-off events. [2025-01-09 16:31:48,441 INFO L125 PetriNetUnfolderBase]: For 9994/9994 co-relation queries the response was YES. [2025-01-09 16:31:48,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268248 conditions, 139216 events. 98531/139216 cut-off events. For 9994/9994 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 1019547 event pairs, 23890 based on Foata normal form. 11088/124117 useless extension candidates. Maximal degree in co-relation 136311. Up to 65858 conditions per place. [2025-01-09 16:31:49,162 INFO L140 encePairwiseOnDemand]: 42/57 looper letters, 139 selfloop transitions, 14 changer transitions 0/168 dead transitions. [2025-01-09 16:31:49,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 168 transitions, 775 flow [2025-01-09 16:31:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:31:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:31:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2025-01-09 16:31:49,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6967418546365914 [2025-01-09 16:31:49,164 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 142 flow. Second operand 7 states and 278 transitions. [2025-01-09 16:31:49,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 168 transitions, 775 flow [2025-01-09 16:31:49,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 168 transitions, 739 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 16:31:49,177 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 226 flow [2025-01-09 16:31:49,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-01-09 16:31:49,178 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2025-01-09 16:31:49,179 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 226 flow [2025-01-09 16:31:49,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:49,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:49,179 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:31:49,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:31:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2137022702, now seen corresponding path program 1 times [2025-01-09 16:31:49,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:49,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535101800] [2025-01-09 16:31:49,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:49,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:49,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:31:49,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:31:49,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:49,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:49,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535101800] [2025-01-09 16:31:49,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535101800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:49,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:49,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318247132] [2025-01-09 16:31:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:49,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:49,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:49,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:49,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-01-09 16:31:49,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:49,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:49,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-01-09 16:31:49,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:32:01,335 INFO L124 PetriNetUnfolderBase]: 153340/218790 cut-off events. [2025-01-09 16:32:01,336 INFO L125 PetriNetUnfolderBase]: For 86765/88862 co-relation queries the response was YES. [2025-01-09 16:32:01,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477474 conditions, 218790 events. 153340/218790 cut-off events. For 86765/88862 co-relation queries the response was YES. Maximal size of possible extension queue 7561. Compared 1726340 event pairs, 43690 based on Foata normal form. 0/187554 useless extension candidates. Maximal degree in co-relation 398172. Up to 111923 conditions per place. [2025-01-09 16:32:02,812 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 145 selfloop transitions, 19 changer transitions 0/180 dead transitions. [2025-01-09 16:32:02,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 180 transitions, 948 flow [2025-01-09 16:32:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:32:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:32:02,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2025-01-09 16:32:02,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2025-01-09 16:32:02,814 INFO L175 Difference]: Start difference. First operand has 68 places, 64 transitions, 226 flow. Second operand 7 states and 255 transitions. [2025-01-09 16:32:02,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 180 transitions, 948 flow [2025-01-09 16:32:03,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 180 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:32:03,106 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 346 flow [2025-01-09 16:32:03,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-01-09 16:32:03,107 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-01-09 16:32:03,107 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 346 flow [2025-01-09 16:32:03,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:03,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:32:03,107 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:32:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:32:03,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thrErr0ASSERT_VIOLATIONERROR_FUNCTION, thrErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-01-09 16:32:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:32:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash -506013688, now seen corresponding path program 1 times [2025-01-09 16:32:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:32:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616192104] [2025-01-09 16:32:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:32:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:32:03,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:32:03,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:32:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:32:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:32:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616192104] [2025-01-09 16:32:03,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616192104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:32:03,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846174162] [2025-01-09 16:32:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:32:03,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:32:03,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:32:03,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:32:03,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:32:03,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:32:03,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:32:03,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:32:03,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:32:03,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:32:03,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:32:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:03,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:32:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:32:03,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846174162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:32:03,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:32:03,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-01-09 16:32:03,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518667478] [2025-01-09 16:32:03,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:32:03,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 16:32:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:32:03,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 16:32:03,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-09 16:32:03,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2025-01-09 16:32:03,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 346 flow. Second operand has 18 states, 18 states have (on average 16.77777777777778) internal successors, (302), 18 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:32:03,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:32:03,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2025-01-09 16:32:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand