./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.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/pthread-C-DAC/pthread-demo-datarace-1.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 f3a0a18d534b5c74c7f313c135e18ad72f924c260e0f7593009872b066240777 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:58:27,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:58:28,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:58:28,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:58:28,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:58:28,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:58:28,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:58:28,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:58:28,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:58:28,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:58:28,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:58:28,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:58:28,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:58:28,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:58:28,046 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:58:28,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:58:28,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:58:28,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:58:28,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:58:28,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:58:28,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:58:28,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:58:28,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:28,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:58:28,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:28,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:58:28,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:58:28,049 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 -> f3a0a18d534b5c74c7f313c135e18ad72f924c260e0f7593009872b066240777 [2025-04-29 10:58:28,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:58:28,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:58:28,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:58:28,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:58:28,251 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:58:28,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c [2025-04-29 10:58:29,582 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4990d81a5/a88e18b5db8d4f249e24c2494beb1ce9/FLAG8d238c664 [2025-04-29 10:58:29,810 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:58:29,811 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c [2025-04-29 10:58:29,812 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:29,812 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:29,812 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:29,812 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:58:29,823 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4990d81a5/a88e18b5db8d4f249e24c2494beb1ce9/FLAG8d238c664 [2025-04-29 10:58:30,584 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4990d81a5/a88e18b5db8d4f249e24c2494beb1ce9 [2025-04-29 10:58:30,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:58:30,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:58:30,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:30,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:58:30,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:58:30,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f22b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30, skipping insertion in model container [2025-04-29 10:58:30,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:58:30,739 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c[836,849] [2025-04-29 10:58:30,760 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:30,769 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:58:30,787 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.c[836,849] [2025-04-29 10:58:30,796 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:58:30,809 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:58:30,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30 WrapperNode [2025-04-29 10:58:30,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:58:30,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:30,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:58:30,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:58:30,816 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:58:30" (1/1) ... [2025-04-29 10:58:30,821 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:58:30" (1/1) ... [2025-04-29 10:58:30,835 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-04-29 10:58:30,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:58:30,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:58:30,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:58:30,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:58:30,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,857 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-04-29 10:58:30,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,859 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,860 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:58:30,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:58:30,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:58:30,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:58:30,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (1/1) ... [2025-04-29 10:58:30,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:58:30,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:30,890 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:58:30,892 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:58:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:58:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:58:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:58:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-04-29 10:58:30,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-04-29 10:58:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:58:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:58:30,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:58:30,908 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:58:30,970 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:58:30,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:58:31,093 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:58:31,093 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:58:31,183 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:58:31,183 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:58:31,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:31 BoogieIcfgContainer [2025-04-29 10:58:31,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:58:31,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:58:31,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:58:31,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:58:31,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:58:30" (1/3) ... [2025-04-29 10:58:31,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf55887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:31, skipping insertion in model container [2025-04-29 10:58:31,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:58:30" (2/3) ... [2025-04-29 10:58:31,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf55887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:58:31, skipping insertion in model container [2025-04-29 10:58:31,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:31" (3/3) ... [2025-04-29 10:58:31,192 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.c [2025-04-29 10:58:31,203 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:58:31,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.c that has 2 procedures, 22 locations, 23 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:58:31,204 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:58:31,237 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 10:58:31,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 55 flow [2025-04-29 10:58:31,288 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-29 10:58:31,290 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:31,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 23 events. 3/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-04-29 10:58:31,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 55 flow [2025-04-29 10:58:31,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 46 flow [2025-04-29 10:58:31,303 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:58:31,313 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;@5d726861, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:58:31,315 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-29 10:58:31,322 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:58:31,325 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-29 10:58:31,325 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:31,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:31,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:31,326 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:31,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2004185727, now seen corresponding path program 1 times [2025-04-29 10:58:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:31,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173356733] [2025-04-29 10:58:31,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:31,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 10:58:31,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 10:58:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:31,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:58:31,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:31,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173356733] [2025-04-29 10:58:31,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173356733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:31,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:31,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:31,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227896240] [2025-04-29 10:58:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:31,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:31,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:31,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:31,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-29 10:58:31,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:58:31,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:31,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-29 10:58:31,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:31,605 INFO L116 PetriNetUnfolderBase]: 61/133 cut-off events. [2025-04-29 10:58:31,608 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 10:58:31,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 133 events. 61/133 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 393 event pairs, 27 based on Foata normal form. 6/138 useless extension candidates. Maximal degree in co-relation 247. Up to 77 conditions per place. [2025-04-29 10:58:31,611 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-04-29 10:58:31,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 118 flow [2025-04-29 10:58:31,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:58:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-04-29 10:58:31,622 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-29 10:58:31,623 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 46 flow. Second operand 3 states and 45 transitions. [2025-04-29 10:58:31,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 118 flow [2025-04-29 10:58:31,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 10:58:31,629 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 54 flow [2025-04-29 10:58:31,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2025-04-29 10:58:31,634 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-04-29 10:58:31,634 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 54 flow [2025-04-29 10:58:31,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:58:31,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:31,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:31,634 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:58:31,635 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:31,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:31,635 INFO L85 PathProgramCache]: Analyzing trace with hash 232330126, now seen corresponding path program 1 times [2025-04-29 10:58:31,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:31,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941377591] [2025-04-29 10:58:31,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:31,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:58:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:58:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:31,697 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:58:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:31,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941377591] [2025-04-29 10:58:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941377591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:31,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:31,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:31,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296849237] [2025-04-29 10:58:31,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:31,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:31,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:31,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:31,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:31,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-29 10:58:31,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:58:31,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:31,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-29 10:58:31,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:31,771 INFO L116 PetriNetUnfolderBase]: 91/208 cut-off events. [2025-04-29 10:58:31,771 INFO L117 PetriNetUnfolderBase]: For 35/36 co-relation queries the response was YES. [2025-04-29 10:58:31,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 208 events. 91/208 cut-off events. For 35/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 746 event pairs, 46 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 123. Up to 113 conditions per place. [2025-04-29 10:58:31,773 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-29 10:58:31,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 134 flow [2025-04-29 10:58:31,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:58:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-29 10:58:31,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-29 10:58:31,774 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 54 flow. Second operand 3 states and 46 transitions. [2025-04-29 10:58:31,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 134 flow [2025-04-29 10:58:31,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:31,775 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 64 flow [2025-04-29 10:58:31,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-04-29 10:58:31,776 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2025-04-29 10:58:31,776 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 64 flow [2025-04-29 10:58:31,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:58:31,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:31,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:31,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:58:31,776 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:31,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1186266365, now seen corresponding path program 1 times [2025-04-29 10:58:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:31,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798883053] [2025-04-29 10:58:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:58:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:31,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:58:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:58:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:31,889 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:58:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:31,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798883053] [2025-04-29 10:58:31,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798883053] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:31,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:31,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:58:31,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390321023] [2025-04-29 10:58:31,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:31,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:58:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:58:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:58:31,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-29 10:58:31,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:58:31,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:31,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-29 10:58:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:31,960 INFO L116 PetriNetUnfolderBase]: 59/155 cut-off events. [2025-04-29 10:58:31,960 INFO L117 PetriNetUnfolderBase]: For 67/68 co-relation queries the response was YES. [2025-04-29 10:58:31,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 155 events. 59/155 cut-off events. For 67/68 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 476 event pairs, 20 based on Foata normal form. 16/170 useless extension candidates. Maximal degree in co-relation 109. Up to 72 conditions per place. [2025-04-29 10:58:31,965 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 20 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-04-29 10:58:31,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 142 flow [2025-04-29 10:58:31,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:58:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:58:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-29 10:58:31,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-04-29 10:58:31,966 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 64 flow. Second operand 3 states and 43 transitions. [2025-04-29 10:58:31,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 142 flow [2025-04-29 10:58:31,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:31,967 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 70 flow [2025-04-29 10:58:31,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-04-29 10:58:31,967 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2025-04-29 10:58:31,967 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 70 flow [2025-04-29 10:58:31,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:58:31,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:31,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:31,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:58:31,968 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:31,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash -421992997, now seen corresponding path program 2 times [2025-04-29 10:58:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:31,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74678833] [2025-04-29 10:58:31,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:31,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:58:31,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:58:31,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 10:58:31,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,035 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:58:32,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:32,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74678833] [2025-04-29 10:58:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74678833] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:58:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:58:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:58:32,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889456683] [2025-04-29 10:58:32,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:58:32,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:58:32,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:58:32,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:58:32,039 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-04-29 10:58:32,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:58:32,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:32,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-04-29 10:58:32,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:32,109 INFO L116 PetriNetUnfolderBase]: 79/214 cut-off events. [2025-04-29 10:58:32,109 INFO L117 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2025-04-29 10:58:32,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 214 events. 79/214 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 738 event pairs, 20 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 117. Up to 89 conditions per place. [2025-04-29 10:58:32,112 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 33 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-04-29 10:58:32,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 210 flow [2025-04-29 10:58:32,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:58:32,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:58:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-29 10:58:32,114 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-04-29 10:58:32,114 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 70 flow. Second operand 4 states and 62 transitions. [2025-04-29 10:58:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 210 flow [2025-04-29 10:58:32,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:32,115 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 82 flow [2025-04-29 10:58:32,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-04-29 10:58:32,115 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-04-29 10:58:32,115 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 82 flow [2025-04-29 10:58:32,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:58:32,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:32,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:32,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:58:32,116 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:32,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:32,116 INFO L85 PathProgramCache]: Analyzing trace with hash -502918354, now seen corresponding path program 3 times [2025-04-29 10:58:32,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:32,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315504749] [2025-04-29 10:58:32,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:58:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:32,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-29 10:58:32,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 25 statements. [2025-04-29 10:58:32,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:58:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:58:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:32,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315504749] [2025-04-29 10:58:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315504749] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:32,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57614121] [2025-04-29 10:58:32,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:58:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:32,160 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:58:32,161 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:58:32,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-04-29 10:58:32,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 25 statements. [2025-04-29 10:58:32,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-29 10:58:32,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 10:58:32,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:58:32,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:32,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 10:58:32,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57614121] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:32,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:32,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-29 10:58:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822299645] [2025-04-29 10:58:32,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:32,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 10:58:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:32,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 10:58:32,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-29 10:58:32,274 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-29 10:58:32,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:58:32,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:32,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-29 10:58:32,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:32,381 INFO L116 PetriNetUnfolderBase]: 227/511 cut-off events. [2025-04-29 10:58:32,382 INFO L117 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2025-04-29 10:58:32,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 511 events. 227/511 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1978 event pairs, 20 based on Foata normal form. 42/553 useless extension candidates. Maximal degree in co-relation 459. Up to 118 conditions per place. [2025-04-29 10:58:32,386 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 61 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2025-04-29 10:58:32,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 70 transitions, 416 flow [2025-04-29 10:58:32,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 10:58:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 10:58:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-04-29 10:58:32,389 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-29 10:58:32,389 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 82 flow. Second operand 6 states and 90 transitions. [2025-04-29 10:58:32,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 70 transitions, 416 flow [2025-04-29 10:58:32,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 70 transitions, 386 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-29 10:58:32,392 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 116 flow [2025-04-29 10:58:32,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2025-04-29 10:58:32,393 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2025-04-29 10:58:32,394 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 116 flow [2025-04-29 10:58:32,394 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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:58:32,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:32,394 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:32,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:32,598 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:32,598 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:32,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1362838783, now seen corresponding path program 4 times [2025-04-29 10:58:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:32,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313164058] [2025-04-29 10:58:32,600 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:58:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:32,608 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:58:32,618 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:58:32,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:58:32,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,689 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-29 10:58:32,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:32,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313164058] [2025-04-29 10:58:32,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313164058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:32,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347120128] [2025-04-29 10:58:32,690 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:58:32,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:32,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:32,692 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:58:32,693 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:58:32,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-29 10:58:32,756 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 10:58:32,757 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:58:32,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:32,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:58:32,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:58:32,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 10:58:32,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347120128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:32,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:32,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2025-04-29 10:58:32,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092357358] [2025-04-29 10:58:32,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:32,925 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 10:58:32,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:32,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 10:58:32,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-04-29 10:58:32,938 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-29 10:58:32,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 116 flow. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:32,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:32,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-29 10:58:32,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:33,647 INFO L116 PetriNetUnfolderBase]: 635/1470 cut-off events. [2025-04-29 10:58:33,648 INFO L117 PetriNetUnfolderBase]: For 2126/2126 co-relation queries the response was YES. [2025-04-29 10:58:33,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4647 conditions, 1470 events. 635/1470 cut-off events. For 2126/2126 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6548 event pairs, 8 based on Foata normal form. 161/1631 useless extension candidates. Maximal degree in co-relation 1299. Up to 265 conditions per place. [2025-04-29 10:58:33,656 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 322 selfloop transitions, 92 changer transitions 0/417 dead transitions. [2025-04-29 10:58:33,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 417 transitions, 2484 flow [2025-04-29 10:58:33,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-29 10:58:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-04-29 10:58:33,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 674 transitions. [2025-04-29 10:58:33,662 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6240740740740741 [2025-04-29 10:58:33,662 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 116 flow. Second operand 45 states and 674 transitions. [2025-04-29 10:58:33,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 417 transitions, 2484 flow [2025-04-29 10:58:33,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 417 transitions, 2404 flow, removed 36 selfloop flow, removed 1 redundant places. [2025-04-29 10:58:33,674 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 992 flow [2025-04-29 10:58:33,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=992, PETRI_PLACES=111, PETRI_TRANSITIONS=110} [2025-04-29 10:58:33,674 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 89 predicate places. [2025-04-29 10:58:33,674 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 992 flow [2025-04-29 10:58:33,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:58:33,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:33,675 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:33,681 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:58:33,879 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,SelfDestructingSolverStorable5 [2025-04-29 10:58:33,879 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:33,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 753600626, now seen corresponding path program 5 times [2025-04-29 10:58:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:33,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793082421] [2025-04-29 10:58:33,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:58:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:33,898 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 11 equivalence classes. [2025-04-29 10:58:33,929 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:58:33,930 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 10:58:33,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 10:58:34,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:34,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793082421] [2025-04-29 10:58:34,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793082421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:34,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365916485] [2025-04-29 10:58:34,012 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:58:34,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:34,014 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:58:34,015 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:58:34,063 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 11 equivalence classes. [2025-04-29 10:58:34,104 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 75 of 75 statements. [2025-04-29 10:58:34,105 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-04-29 10:58:34,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:34,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:58:34,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 10:58:34,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 10:58:34,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365916485] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:34,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:34,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 26 [2025-04-29 10:58:34,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867395018] [2025-04-29 10:58:34,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:34,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-29 10:58:34,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:34,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-29 10:58:34,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=405, Unknown=0, NotChecked=0, Total=650 [2025-04-29 10:58:34,530 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-29 10:58:34,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 992 flow. Second operand has 26 states, 26 states have (on average 10.23076923076923) internal successors, (266), 26 states have internal predecessors, (266), 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:58:34,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:34,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-29 10:58:34,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:36,765 INFO L116 PetriNetUnfolderBase]: 1467/3366 cut-off events. [2025-04-29 10:58:36,765 INFO L117 PetriNetUnfolderBase]: For 123752/123752 co-relation queries the response was YES. [2025-04-29 10:58:36,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16939 conditions, 3366 events. 1467/3366 cut-off events. For 123752/123752 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 16401 event pairs, 8 based on Foata normal form. 323/3689 useless extension candidates. Maximal degree in co-relation 14759. Up to 618 conditions per place. [2025-04-29 10:58:36,787 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 766 selfloop transitions, 255 changer transitions 0/1024 dead transitions. [2025-04-29 10:58:36,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 1024 transitions, 8912 flow [2025-04-29 10:58:36,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-29 10:58:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2025-04-29 10:58:36,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1582 transitions. [2025-04-29 10:58:36,793 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6218553459119497 [2025-04-29 10:58:36,794 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 992 flow. Second operand 106 states and 1582 transitions. [2025-04-29 10:58:36,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 1024 transitions, 8912 flow [2025-04-29 10:58:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1024 transitions, 8634 flow, removed 62 selfloop flow, removed 5 redundant places. [2025-04-29 10:58:36,868 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 3728 flow [2025-04-29 10:58:36,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=3728, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2025-04-29 10:58:36,869 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 254 predicate places. [2025-04-29 10:58:36,870 INFO L485 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 3728 flow [2025-04-29 10:58:36,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.23076923076923) internal successors, (266), 26 states have internal predecessors, (266), 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:58:36,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:36,870 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:36,877 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:58:37,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:37,075 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:37,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1857494469, now seen corresponding path program 6 times [2025-04-29 10:58:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:37,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130815682] [2025-04-29 10:58:37,076 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:58:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:37,097 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 21 equivalence classes. [2025-04-29 10:58:37,119 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 70 of 130 statements. [2025-04-29 10:58:37,119 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-04-29 10:58:37,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-29 10:58:37,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:37,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130815682] [2025-04-29 10:58:37,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130815682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:37,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686593446] [2025-04-29 10:58:37,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:58:37,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:37,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:37,246 INFO L229 MonitoredProcess]: Starting monitored process 5 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:58:37,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 10:58:37,312 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 130 statements into 21 equivalence classes. [2025-04-29 10:58:37,351 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 70 of 130 statements. [2025-04-29 10:58:37,352 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2025-04-29 10:58:37,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:58:37,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-29 10:58:37,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1004 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-29 10:58:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686593446] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:37,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:37,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-29 10:58:37,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676169092] [2025-04-29 10:58:37,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:37,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 10:58:37,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:37,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 10:58:37,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:58:37,609 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-29 10:58:37,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 3728 flow. Second operand has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 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:58:37,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:37,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-29 10:58:37,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:39,339 INFO L116 PetriNetUnfolderBase]: 2885/6839 cut-off events. [2025-04-29 10:58:39,339 INFO L117 PetriNetUnfolderBase]: For 508415/508699 co-relation queries the response was YES. [2025-04-29 10:58:39,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49124 conditions, 6839 events. 2885/6839 cut-off events. For 508415/508699 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 41139 event pairs, 392 based on Foata normal form. 606/7268 useless extension candidates. Maximal degree in co-relation 46062. Up to 1113 conditions per place. [2025-04-29 10:58:39,406 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 309 selfloop transitions, 152 changer transitions 0/475 dead transitions. [2025-04-29 10:58:39,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 475 transitions, 6732 flow [2025-04-29 10:58:39,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:58:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 10:58:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2025-04-29 10:58:39,408 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2025-04-29 10:58:39,409 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 3728 flow. Second operand 12 states and 190 transitions. [2025-04-29 10:58:39,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 475 transitions, 6732 flow [2025-04-29 10:58:39,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 475 transitions, 5940 flow, removed 261 selfloop flow, removed 36 redundant places. [2025-04-29 10:58:39,901 INFO L231 Difference]: Finished difference. Result has 258 places, 283 transitions, 3780 flow [2025-04-29 10:58:39,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3044, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3780, PETRI_PLACES=258, PETRI_TRANSITIONS=283} [2025-04-29 10:58:39,902 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 236 predicate places. [2025-04-29 10:58:39,902 INFO L485 AbstractCegarLoop]: Abstraction has has 258 places, 283 transitions, 3780 flow [2025-04-29 10:58:39,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.923076923076923) internal successors, (142), 13 states have internal predecessors, (142), 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:58:39,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:39,902 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:39,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:40,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:40,103 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:40,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2106705115, now seen corresponding path program 7 times [2025-04-29 10:58:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:40,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143134001] [2025-04-29 10:58:40,105 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 10:58:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:40,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-29 10:58:40,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-29 10:58:40,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:40,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-04-29 10:58:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:40,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143134001] [2025-04-29 10:58:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143134001] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:40,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520414659] [2025-04-29 10:58:40,458 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-29 10:58:40,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:40,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:40,460 INFO L229 MonitoredProcess]: Starting monitored process 6 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:58:40,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 10:58:40,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-29 10:58:40,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-29 10:58:40,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:58:40,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:40,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 10:58:40,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-04-29 10:58:40,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2025-04-29 10:58:40,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520414659] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:40,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-04-29 10:58:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586739390] [2025-04-29 10:58:40,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:40,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:58:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:40,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:58:40,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:58:40,909 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-29 10:58:40,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 283 transitions, 3780 flow. Second operand has 23 states, 23 states have (on average 11.347826086956522) internal successors, (261), 23 states have internal predecessors, (261), 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:58:40,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:40,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-29 10:58:40,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:44,207 INFO L116 PetriNetUnfolderBase]: 5534/12958 cut-off events. [2025-04-29 10:58:44,208 INFO L117 PetriNetUnfolderBase]: For 1259312/1259864 co-relation queries the response was YES. [2025-04-29 10:58:44,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107838 conditions, 12958 events. 5534/12958 cut-off events. For 1259312/1259864 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 85479 event pairs, 562 based on Foata normal form. 1022/13623 useless extension candidates. Maximal degree in co-relation 100652. Up to 2163 conditions per place. [2025-04-29 10:58:44,320 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 589 selfloop transitions, 162 changer transitions 0/765 dead transitions. [2025-04-29 10:58:44,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 765 transitions, 10302 flow [2025-04-29 10:58:44,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 10:58:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-29 10:58:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 354 transitions. [2025-04-29 10:58:44,322 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6704545454545454 [2025-04-29 10:58:44,323 INFO L175 Difference]: Start difference. First operand has 258 places, 283 transitions, 3780 flow. Second operand 22 states and 354 transitions. [2025-04-29 10:58:44,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 765 transitions, 10302 flow [2025-04-29 10:58:45,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 765 transitions, 9552 flow, removed 256 selfloop flow, removed 4 redundant places. [2025-04-29 10:58:45,017 INFO L231 Difference]: Finished difference. Result has 286 places, 294 transitions, 4176 flow [2025-04-29 10:58:45,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4176, PETRI_PLACES=286, PETRI_TRANSITIONS=294} [2025-04-29 10:58:45,019 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 264 predicate places. [2025-04-29 10:58:45,019 INFO L485 AbstractCegarLoop]: Abstraction has has 286 places, 294 transitions, 4176 flow [2025-04-29 10:58:45,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.347826086956522) internal successors, (261), 23 states have internal predecessors, (261), 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:58:45,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:58:45,019 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:58:45,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 10:58:45,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:45,220 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:58:45,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:58:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 947445957, now seen corresponding path program 8 times [2025-04-29 10:58:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:58:45,222 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389709497] [2025-04-29 10:58:45,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:45,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:58:45,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-04-29 10:58:45,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-04-29 10:58:45,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:45,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:47,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:47,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:58:47,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389709497] [2025-04-29 10:58:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389709497] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:58:47,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809260596] [2025-04-29 10:58:47,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:58:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:58:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:58:47,138 INFO L229 MonitoredProcess]: Starting monitored process 7 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:58:47,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 10:58:47,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 210 statements into 2 equivalence classes. [2025-04-29 10:58:47,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-04-29 10:58:47,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:58:47,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:58:47,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-04-29 10:58:47,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:58:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:47,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:58:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:58:47,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809260596] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:58:47,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:58:47,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 44 [2025-04-29 10:58:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121563720] [2025-04-29 10:58:47,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:58:47,716 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 10:58:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:58:47,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 10:58:47,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2025-04-29 10:58:47,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-29 10:58:47,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 294 transitions, 4176 flow. Second operand has 45 states, 45 states have (on average 8.777777777777779) internal successors, (395), 45 states have internal predecessors, (395), 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:58:47,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:58:47,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-29 10:58:47,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:58:57,820 INFO L116 PetriNetUnfolderBase]: 9003/23259 cut-off events. [2025-04-29 10:58:57,820 INFO L117 PetriNetUnfolderBase]: For 3667236/3667236 co-relation queries the response was YES. [2025-04-29 10:58:57,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252116 conditions, 23259 events. 9003/23259 cut-off events. For 3667236/3667236 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 184509 event pairs, 943 based on Foata normal form. 1/23259 useless extension candidates. Maximal degree in co-relation 241922. Up to 5263 conditions per place. [2025-04-29 10:58:58,033 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 1960 selfloop transitions, 83 changer transitions 2/2061 dead transitions. [2025-04-29 10:58:58,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 2061 transitions, 44119 flow [2025-04-29 10:58:58,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-29 10:58:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-29 10:58:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 666 transitions. [2025-04-29 10:58:58,036 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-04-29 10:58:58,036 INFO L175 Difference]: Start difference. First operand has 286 places, 294 transitions, 4176 flow. Second operand 44 states and 666 transitions. [2025-04-29 10:58:58,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 2061 transitions, 44119 flow [2025-04-29 10:59:05,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2061 transitions, 43016 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-04-29 10:59:05,497 INFO L231 Difference]: Finished difference. Result has 322 places, 376 transitions, 4250 flow [2025-04-29 10:59:05,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3908, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4250, PETRI_PLACES=322, PETRI_TRANSITIONS=376} [2025-04-29 10:59:05,498 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 300 predicate places. [2025-04-29 10:59:05,498 INFO L485 AbstractCegarLoop]: Abstraction has has 322 places, 376 transitions, 4250 flow [2025-04-29 10:59:05,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.777777777777779) internal successors, (395), 45 states have internal predecessors, (395), 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:59:05,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:59:05,498 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:59:05,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 10:59:05,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:59:05,699 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:59:05,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:59:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 902243782, now seen corresponding path program 9 times [2025-04-29 10:59:05,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:59:05,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622245553] [2025-04-29 10:59:05,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:59:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:59:05,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 215 statements into 21 equivalence classes. [2025-04-29 10:59:05,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) and asserted 215 of 215 statements. [2025-04-29 10:59:05,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2025-04-29 10:59:05,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:59:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 970 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-04-29 10:59:06,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:59:06,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622245553] [2025-04-29 10:59:06,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622245553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:59:06,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:59:06,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-04-29 10:59:06,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133744777] [2025-04-29 10:59:06,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:59:06,358 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:59:06,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:59:06,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:59:06,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2025-04-29 10:59:06,368 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-04-29 10:59:06,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 376 transitions, 4250 flow. Second operand has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 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:59:06,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:59:06,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-04-29 10:59:06,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:59:11,900 INFO L116 PetriNetUnfolderBase]: 9149/21016 cut-off events. [2025-04-29 10:59:11,900 INFO L117 PetriNetUnfolderBase]: For 2509499/2509499 co-relation queries the response was YES. [2025-04-29 10:59:12,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206657 conditions, 21016 events. 9149/21016 cut-off events. For 2509499/2509499 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 158061 event pairs, 74 based on Foata normal form. 89/21104 useless extension candidates. Maximal degree in co-relation 206526. Up to 5070 conditions per place. [2025-04-29 10:59:12,101 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 2027 selfloop transitions, 105 changer transitions 0/2137 dead transitions. [2025-04-29 10:59:12,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 2137 transitions, 31662 flow [2025-04-29 10:59:12,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:59:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 10:59:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 354 transitions. [2025-04-29 10:59:12,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2025-04-29 10:59:12,102 INFO L175 Difference]: Start difference. First operand has 322 places, 376 transitions, 4250 flow. Second operand 23 states and 354 transitions. [2025-04-29 10:59:12,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 2137 transitions, 31662 flow [2025-04-29 10:59:15,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 2137 transitions, 31660 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 10:59:15,279 INFO L231 Difference]: Finished difference. Result has 342 places, 371 transitions, 4388 flow [2025-04-29 10:59:15,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4178, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4388, PETRI_PLACES=342, PETRI_TRANSITIONS=371} [2025-04-29 10:59:15,280 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 320 predicate places. [2025-04-29 10:59:15,280 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 371 transitions, 4388 flow [2025-04-29 10:59:15,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.130434782608695) internal successors, (233), 23 states have internal predecessors, (233), 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:59:15,280 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:59:15,280 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:59:15,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 10:59:15,280 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-29 10:59:15,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:59:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash 223566854, now seen corresponding path program 10 times [2025-04-29 10:59:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:59:15,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888508925] [2025-04-29 10:59:15,282 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:59:15,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:59:15,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 215 statements into 2 equivalence classes. [2025-04-29 10:59:15,327 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-04-29 10:59:15,328 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:59:15,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:59:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 975 proven. 96 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-29 10:59:15,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:59:15,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888508925] [2025-04-29 10:59:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888508925] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:59:15,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491031411] [2025-04-29 10:59:15,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:59:15,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:59:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:59:15,707 INFO L229 MonitoredProcess]: Starting monitored process 8 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:59:15,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 10:59:15,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 215 statements into 2 equivalence classes. [2025-04-29 10:59:15,918 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-04-29 10:59:15,918 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 10:59:15,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:59:15,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 10:59:15,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:59:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-04-29 10:59:16,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 10:59:16,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491031411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:59:16,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 10:59:16,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [23] total 24 [2025-04-29 10:59:16,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970532119] [2025-04-29 10:59:16,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:59:16,019 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 10:59:16,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:59:16,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 10:59:16,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2025-04-29 10:59:16,034 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-04-29 10:59:16,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 371 transitions, 4388 flow. Second operand has 23 states, 23 states have (on average 11.043478260869565) internal successors, (254), 23 states have internal predecessors, (254), 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:59:16,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:59:16,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-04-29 10:59:16,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:59:18,513 INFO L116 PetriNetUnfolderBase]: 5398/12775 cut-off events. [2025-04-29 10:59:18,513 INFO L117 PetriNetUnfolderBase]: For 494428/494920 co-relation queries the response was YES. [2025-04-29 10:59:18,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89802 conditions, 12775 events. 5398/12775 cut-off events. For 494428/494920 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 86185 event pairs, 457 based on Foata normal form. 84/12503 useless extension candidates. Maximal degree in co-relation 89144. Up to 2163 conditions per place. [2025-04-29 10:59:18,618 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 0 selfloop transitions, 0 changer transitions 1618/1618 dead transitions. [2025-04-29 10:59:18,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1618 transitions, 15951 flow [2025-04-29 10:59:18,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-29 10:59:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-29 10:59:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 354 transitions. [2025-04-29 10:59:18,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6413043478260869 [2025-04-29 10:59:18,619 INFO L175 Difference]: Start difference. First operand has 342 places, 371 transitions, 4388 flow. Second operand 23 states and 354 transitions. [2025-04-29 10:59:18,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1618 transitions, 15951 flow [2025-04-29 10:59:19,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 1618 transitions, 15013 flow, removed 0 selfloop flow, removed 24 redundant places. [2025-04-29 10:59:19,549 INFO L231 Difference]: Finished difference. Result has 337 places, 0 transitions, 0 flow [2025-04-29 10:59:19,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=4112, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=0, PETRI_PLACES=337, PETRI_TRANSITIONS=0} [2025-04-29 10:59:19,550 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 315 predicate places. [2025-04-29 10:59:19,550 INFO L485 AbstractCegarLoop]: Abstraction has has 337 places, 0 transitions, 0 flow [2025-04-29 10:59:19,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.043478260869565) internal successors, (254), 23 states have internal predecessors, (254), 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:59:19,552 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-04-29 10:59:19,552 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-29 10:59:19,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 10:59:19,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:59:19,753 INFO L422 BasicCegarLoop]: Path program histogram: [10, 1, 1] [2025-04-29 10:59:19,755 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:59:19,755 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:59:19,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:59:19 BasicIcfg [2025-04-29 10:59:19,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:59:19,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:59:19,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:59:19,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:59:19,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:58:31" (3/4) ... [2025-04-29 10:59:19,761 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:59:19,762 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread_function_mutex [2025-04-29 10:59:19,764 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-04-29 10:59:19,764 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-04-29 10:59:19,764 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 10:59:19,765 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-29 10:59:19,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:59:19,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:59:19,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:59:19,809 INFO L158 Benchmark]: Toolchain (without parser) took 49222.25ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 122.6MB in the beginning and 633.3MB in the end (delta: -510.8MB). Peak memory consumption was 3.2GB. Max. memory is 16.1GB. [2025-04-29 10:59:19,809 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:59:19,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.27ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 108.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:59:19,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 107.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:59:19,811 INFO L158 Benchmark]: Boogie Preprocessor took 27.68ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:59:19,811 INFO L158 Benchmark]: RCFGBuilder took 317.40ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:59:19,811 INFO L158 Benchmark]: TraceAbstraction took 48573.53ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 86.7MB in the beginning and 637.0MB in the end (delta: -550.3MB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. [2025-04-29 10:59:19,812 INFO L158 Benchmark]: Witness Printer took 49.68ms. Allocated memory is still 3.9GB. Free memory was 637.0MB in the beginning and 633.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:59:19,812 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.22ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.27ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 108.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 107.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.68ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 105.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.40ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48573.53ms. Allocated memory was 167.8MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 86.7MB in the beginning and 637.0MB in the end (delta: -550.3MB). Peak memory consumption was 3.3GB. Max. memory is 16.1GB. * Witness Printer took 49.68ms. Allocated memory is still 3.9GB. Free memory was 637.0MB in the beginning and 633.3MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: 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, 30 locations, 33 edges, 2 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: 48.5s, OverallIterations: 12, TraceHistogramMax: 21, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3004 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2989 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 341 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21044 IncrementalHoareTripleChecker+Invalid, 21098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 4 mSDtfsCounter, 21044 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1840 GetRequests, 1559 SyntacticMatches, 5 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3947 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4388occurred in iteration=11, InterpolantAutomatonStates: 294, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1990 NumberOfCodeBlocks, 1860 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 2605 ConstructedInterpolants, 0 QuantifiedInterpolants, 6576 SizeOfPredicates, 22 NumberOfNonLiveVariables, 3264 ConjunctsInSsa, 186 ConjunctsInUnsatCore, 25 InterpolantComputations, 6 PerfectInterpolantSequences, 10538/17834 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 10:59:19,823 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