./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe003_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe003_tso.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cc60b32bd5539dadbcbe1bdf86f21665a573ec180c72ba491085256c00923963 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:29:33,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:29:33,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:29:33,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:29:33,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:29:33,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:29:33,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:29:33,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:29:33,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:29:33,445 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:29:33,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:29:33,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:29:33,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:29:33,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:29:33,445 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:29:33,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:29:33,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:29:33,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:29:33,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:29:33,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:29:33,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:29:33,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:29:33,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:33,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:33,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:29:33,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:29:33,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:29:33,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:29:33,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cc60b32bd5539dadbcbe1bdf86f21665a573ec180c72ba491085256c00923963 [2025-01-09 16:29:33,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:29:33,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:29:33,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:29:33,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:29:33,677 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:29:33,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe003_tso.i [2025-01-09 16:29:34,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d58e94a54/e85e6f94cd2d4d7cb9bbeaf83f502a03/FLAG3f80ad9b6 [2025-01-09 16:29:35,242 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:29:35,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_tso.i [2025-01-09 16:29:35,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d58e94a54/e85e6f94cd2d4d7cb9bbeaf83f502a03/FLAG3f80ad9b6 [2025-01-09 16:29:35,513 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d58e94a54/e85e6f94cd2d4d7cb9bbeaf83f502a03 [2025-01-09 16:29:35,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:29:35,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:29:35,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:29:35,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:29:35,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:29:35,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1366c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35, skipping insertion in model container [2025-01-09 16:29:35,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:29:35,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_tso.i[945,958] [2025-01-09 16:29:35,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:29:35,783 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:29:35,790 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe003_tso.i[945,958] [2025-01-09 16:29:35,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:29:35,858 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:29:35,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35 WrapperNode [2025-01-09 16:29:35,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:29:35,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:29:35,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:29:35,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:29:35,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,888 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-01-09 16:29:35,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:29:35,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:29:35,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:29:35,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:29:35,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:29:35,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:29:35,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:29:35,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:29:35,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:29:35,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (1/1) ... [2025-01-09 16:29:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:29:35,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:29:35,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:29:35,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:29:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:29:35,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:29:35,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:29:35,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:29:35,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:29:35,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:29:35,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:29:35,967 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:29:36,047 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:29:36,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:29:36,141 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:29:36,141 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:29:36,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:29:36,216 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:29:36,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:36 BoogieIcfgContainer [2025-01-09 16:29:36,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:29:36,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:29:36,221 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:29:36,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:29:36,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:29:35" (1/3) ... [2025-01-09 16:29:36,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c840911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:29:36, skipping insertion in model container [2025-01-09 16:29:36,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:29:35" (2/3) ... [2025-01-09 16:29:36,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c840911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:29:36, skipping insertion in model container [2025-01-09 16:29:36,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:36" (3/3) ... [2025-01-09 16:29:36,229 INFO L128 eAbstractionObserver]: Analyzing ICFG safe003_tso.i [2025-01-09 16:29:36,246 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:29:36,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe003_tso.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:29:36,247 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:29:36,283 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:29:36,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-01-09 16:29:36,321 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-01-09 16:29:36,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:29:36,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-01-09 16:29:36,324 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-01-09 16:29:36,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-01-09 16:29:36,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:29:36,340 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70a338c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:29:36,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:29:36,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:29:36,348 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 16:29:36,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:29:36,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:36,348 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:36,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 958553775, now seen corresponding path program 1 times [2025-01-09 16:29:36,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:36,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243827043] [2025-01-09 16:29:36,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:36,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:36,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:29:36,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:29:36,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:36,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243827043] [2025-01-09 16:29:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243827043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:36,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:36,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:29:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714991322] [2025-01-09 16:29:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:36,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:29:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:29:36,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:29:36,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-09 16:29:36,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:36,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:36,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-09 16:29:36,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:37,248 INFO L124 PetriNetUnfolderBase]: 1188/2237 cut-off events. [2025-01-09 16:29:37,249 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 16:29:37,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4129 conditions, 2237 events. 1188/2237 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 15773 event pairs, 328 based on Foata normal form. 79/2269 useless extension candidates. Maximal degree in co-relation 4118. Up to 765 conditions per place. [2025-01-09 16:29:37,264 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 29 selfloop transitions, 6 changer transitions 35/83 dead transitions. [2025-01-09 16:29:37,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 321 flow [2025-01-09 16:29:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:29:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:29:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2025-01-09 16:29:37,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6917293233082706 [2025-01-09 16:29:37,275 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 184 transitions. [2025-01-09 16:29:37,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 321 flow [2025-01-09 16:29:37,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 83 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:37,286 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 144 flow [2025-01-09 16:29:37,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2025-01-09 16:29:37,294 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-01-09 16:29:37,294 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 144 flow [2025-01-09 16:29:37,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:37,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:37,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:37,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:29:37,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1253896208, now seen corresponding path program 1 times [2025-01-09 16:29:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:37,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100054382] [2025-01-09 16:29:37,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:29:37,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:29:37,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:37,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100054382] [2025-01-09 16:29:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100054382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:29:37,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592290117] [2025-01-09 16:29:37,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:37,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:29:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:29:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:29:37,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-09 16:29:37,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:37,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:37,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-09 16:29:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:37,732 INFO L124 PetriNetUnfolderBase]: 846/1746 cut-off events. [2025-01-09 16:29:37,733 INFO L125 PetriNetUnfolderBase]: For 1798/1803 co-relation queries the response was YES. [2025-01-09 16:29:37,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 1746 events. 846/1746 cut-off events. For 1798/1803 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12460 event pairs, 209 based on Foata normal form. 69/1779 useless extension candidates. Maximal degree in co-relation 4650. Up to 358 conditions per place. [2025-01-09 16:29:37,744 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 33 selfloop transitions, 6 changer transitions 50/102 dead transitions. [2025-01-09 16:29:37,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 102 transitions, 640 flow [2025-01-09 16:29:37,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:29:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:29:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2025-01-09 16:29:37,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-01-09 16:29:37,749 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 144 flow. Second operand 10 states and 237 transitions. [2025-01-09 16:29:37,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 102 transitions, 640 flow [2025-01-09 16:29:37,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 584 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-09 16:29:37,762 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 198 flow [2025-01-09 16:29:37,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=198, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2025-01-09 16:29:37,763 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-01-09 16:29:37,763 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 198 flow [2025-01-09 16:29:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:37,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:37,764 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:37,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:29:37,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:37,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:37,766 INFO L85 PathProgramCache]: Analyzing trace with hash -114621907, now seen corresponding path program 1 times [2025-01-09 16:29:37,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:37,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533366401] [2025-01-09 16:29:37,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:37,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:37,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:29:37,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:29:37,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:37,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:37,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533366401] [2025-01-09 16:29:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533366401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:29:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586063938] [2025-01-09 16:29:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:37,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:37,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:37,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-09 16:29:37,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 40 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:37,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:37,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-09 16:29:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:38,166 INFO L124 PetriNetUnfolderBase]: 744/1625 cut-off events. [2025-01-09 16:29:38,166 INFO L125 PetriNetUnfolderBase]: For 2943/2943 co-relation queries the response was YES. [2025-01-09 16:29:38,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 1625 events. 744/1625 cut-off events. For 2943/2943 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11876 event pairs, 116 based on Foata normal form. 30/1608 useless extension candidates. Maximal degree in co-relation 4470. Up to 556 conditions per place. [2025-01-09 16:29:38,174 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 35 selfloop transitions, 9 changer transitions 38/95 dead transitions. [2025-01-09 16:29:38,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 672 flow [2025-01-09 16:29:38,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:29:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:29:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2025-01-09 16:29:38,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6286549707602339 [2025-01-09 16:29:38,176 INFO L175 Difference]: Start difference. First operand has 63 places, 40 transitions, 198 flow. Second operand 9 states and 215 transitions. [2025-01-09 16:29:38,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 672 flow [2025-01-09 16:29:38,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 603 flow, removed 32 selfloop flow, removed 3 redundant places. [2025-01-09 16:29:38,184 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 200 flow [2025-01-09 16:29:38,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=200, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2025-01-09 16:29:38,185 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2025-01-09 16:29:38,185 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 200 flow [2025-01-09 16:29:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.0) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:38,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:38,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:38,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:29:38,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1803196892, now seen corresponding path program 1 times [2025-01-09 16:29:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977905642] [2025-01-09 16:29:38,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:38,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:29:38,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:29:38,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:38,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:38,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:38,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977905642] [2025-01-09 16:29:38,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977905642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:38,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:38,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:29:38,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858932258] [2025-01-09 16:29:38,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:38,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:38,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:38,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:38,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:38,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-09 16:29:38,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:38,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:38,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-09 16:29:38,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:38,514 INFO L124 PetriNetUnfolderBase]: 494/1155 cut-off events. [2025-01-09 16:29:38,515 INFO L125 PetriNetUnfolderBase]: For 1744/1744 co-relation queries the response was YES. [2025-01-09 16:29:38,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3142 conditions, 1155 events. 494/1155 cut-off events. For 1744/1744 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8326 event pairs, 124 based on Foata normal form. 20/1149 useless extension candidates. Maximal degree in co-relation 3112. Up to 315 conditions per place. [2025-01-09 16:29:38,521 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 32 selfloop transitions, 8 changer transitions 21/74 dead transitions. [2025-01-09 16:29:38,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 496 flow [2025-01-09 16:29:38,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:29:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:29:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2025-01-09 16:29:38,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6353383458646616 [2025-01-09 16:29:38,522 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 200 flow. Second operand 7 states and 169 transitions. [2025-01-09 16:29:38,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 496 flow [2025-01-09 16:29:38,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 387 flow, removed 34 selfloop flow, removed 17 redundant places. [2025-01-09 16:29:38,529 INFO L231 Difference]: Finished difference. Result has 57 places, 36 transitions, 159 flow [2025-01-09 16:29:38,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=57, PETRI_TRANSITIONS=36} [2025-01-09 16:29:38,530 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2025-01-09 16:29:38,530 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 36 transitions, 159 flow [2025-01-09 16:29:38,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:38,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:38,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:38,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:29:38,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:38,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash 625082506, now seen corresponding path program 2 times [2025-01-09 16:29:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685124970] [2025-01-09 16:29:38,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:29:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:38,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-01-09 16:29:38,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 16:29:38,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:29:38,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:38,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:38,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685124970] [2025-01-09 16:29:38,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685124970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:38,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:38,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:29:38,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331989927] [2025-01-09 16:29:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:38,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:38,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:38,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:38,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:38,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-09 16:29:38,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 36 transitions, 159 flow. Second operand has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:38,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:38,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-09 16:29:38,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:38,854 INFO L124 PetriNetUnfolderBase]: 234/553 cut-off events. [2025-01-09 16:29:38,855 INFO L125 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2025-01-09 16:29:38,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 553 events. 234/553 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3296 event pairs, 47 based on Foata normal form. 12/550 useless extension candidates. Maximal degree in co-relation 1356. Up to 150 conditions per place. [2025-01-09 16:29:38,857 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 23 selfloop transitions, 4 changer transitions 33/73 dead transitions. [2025-01-09 16:29:38,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 73 transitions, 391 flow [2025-01-09 16:29:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:29:38,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:29:38,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 221 transitions. [2025-01-09 16:29:38,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5815789473684211 [2025-01-09 16:29:38,858 INFO L175 Difference]: Start difference. First operand has 57 places, 36 transitions, 159 flow. Second operand 10 states and 221 transitions. [2025-01-09 16:29:38,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 73 transitions, 391 flow [2025-01-09 16:29:38,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 351 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-09 16:29:38,861 INFO L231 Difference]: Finished difference. Result has 62 places, 32 transitions, 120 flow [2025-01-09 16:29:38,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=120, PETRI_PLACES=62, PETRI_TRANSITIONS=32} [2025-01-09 16:29:38,861 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2025-01-09 16:29:38,861 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 32 transitions, 120 flow [2025-01-09 16:29:38,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.142857142857142) internal successors, (127), 7 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:38,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:29:38,862 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:29:38,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:29:38,862 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:29:38,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:29:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 522342750, now seen corresponding path program 1 times [2025-01-09 16:29:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:29:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505275895] [2025-01-09 16:29:38,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:29:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:29:38,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:29:38,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:29:38,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:29:38,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:29:39,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:29:39,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:29:39,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505275895] [2025-01-09 16:29:39,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505275895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:29:39,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:29:39,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:29:39,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482469180] [2025-01-09 16:29:39,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:29:39,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:29:39,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:29:39,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:29:39,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:29:39,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:29:39,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 32 transitions, 120 flow. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:39,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:29:39,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:29:39,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:29:39,139 INFO L124 PetriNetUnfolderBase]: 133/288 cut-off events. [2025-01-09 16:29:39,139 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2025-01-09 16:29:39,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 288 events. 133/288 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1289 event pairs, 53 based on Foata normal form. 12/289 useless extension candidates. Maximal degree in co-relation 710. Up to 106 conditions per place. [2025-01-09 16:29:39,140 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2025-01-09 16:29:39,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 48 transitions, 232 flow [2025-01-09 16:29:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:29:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:29:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2025-01-09 16:29:39,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5230263157894737 [2025-01-09 16:29:39,142 INFO L175 Difference]: Start difference. First operand has 62 places, 32 transitions, 120 flow. Second operand 8 states and 159 transitions. [2025-01-09 16:29:39,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 48 transitions, 232 flow [2025-01-09 16:29:39,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 195 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-01-09 16:29:39,143 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2025-01-09 16:29:39,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2025-01-09 16:29:39,143 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-01-09 16:29:39,143 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2025-01-09 16:29:39,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:29:39,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:29:39,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:29:39,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:29:39,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-09 16:29:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:29:39,147 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-01-09 16:29:39,150 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:29:39,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:29:39,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:29:39 BasicIcfg [2025-01-09 16:29:39,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:29:39,154 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:29:39,154 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:29:39,154 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:29:39,155 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:29:36" (3/4) ... [2025-01-09 16:29:39,157 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:29:39,158 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2025-01-09 16:29:39,158 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2025-01-09 16:29:39,159 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2025-01-09 16:29:39,161 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-01-09 16:29:39,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 16:29:39,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:29:39,162 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:29:39,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:29:39,211 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:29:39,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:29:39,211 INFO L158 Benchmark]: Toolchain (without parser) took 3694.90ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 112.1MB in the beginning and 141.9MB in the end (delta: -29.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,212 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:29:39,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.85ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 91.6MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,212 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,212 INFO L158 Benchmark]: Boogie Preprocessor took 25.22ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:29:39,212 INFO L158 Benchmark]: RCFGBuilder took 301.56ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 70.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,213 INFO L158 Benchmark]: TraceAbstraction took 2935.35ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 69.7MB in the beginning and 148.6MB in the end (delta: -78.9MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,213 INFO L158 Benchmark]: Witness Printer took 56.97ms. Allocated memory is still 184.5MB. Free memory was 148.6MB in the beginning and 141.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:29:39,214 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.18ms. Allocated memory is still 226.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.85ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 91.6MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.52ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.22ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.56ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 70.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2935.35ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 69.7MB in the beginning and 148.6MB in the end (delta: -78.9MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Witness Printer took 56.97ms. Allocated memory is still 184.5MB. Free memory was 148.6MB in the beginning and 141.9MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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 7 procedures, 62 locations, 4 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: 2.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 641 IncrementalHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 72 mSDtfsCounter, 641 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=3, InterpolantAutomatonStates: 51, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 107 ConstructedInterpolants, 0 QuantifiedInterpolants, 571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-01-09 16:29:39,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE