./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_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/safe030_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 1730fa7f98e17ee8b58920ef3daf63ee88225f1b42924032a532b5f5db33fba5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:31:14,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:31:14,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:31:14,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:31:14,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:31:14,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:31:14,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:31:14,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:31:14,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:31:14,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:31:14,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:31:14,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:31:14,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:31:14,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:31:14,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:31:14,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:14,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:14,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:14,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:31:14,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:31:14,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:31:14,653 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 -> 1730fa7f98e17ee8b58920ef3daf63ee88225f1b42924032a532b5f5db33fba5 [2025-01-09 16:31:14,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:31:14,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:31:14,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:31:14,842 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:31:14,842 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:31:14,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_tso.i [2025-01-09 16:31:16,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c778d4b17/3ea50ac6ef964f848d9d51e069e57bfa/FLAGeb244e1e9 [2025-01-09 16:31:16,422 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:31:16,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_tso.i [2025-01-09 16:31:16,456 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c778d4b17/3ea50ac6ef964f848d9d51e069e57bfa/FLAGeb244e1e9 [2025-01-09 16:31:16,669 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c778d4b17/3ea50ac6ef964f848d9d51e069e57bfa [2025-01-09 16:31:16,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:31:16,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:31:16,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:16,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:31:16,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:31:16,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:16" (1/1) ... [2025-01-09 16:31:16,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fcac6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:16, skipping insertion in model container [2025-01-09 16:31:16,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:31:16" (1/1) ... [2025-01-09 16:31:16,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:31:16,815 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/safe030_tso.i[945,958] [2025-01-09 16:31:16,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:16,962 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:31:16,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_tso.i[945,958] [2025-01-09 16:31:16,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:31:17,017 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:31:17,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17 WrapperNode [2025-01-09 16:31:17,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:31:17,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:17,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:31:17,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:31:17,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,048 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-01-09 16:31:17,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:31:17,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:31:17,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:31:17,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:31:17,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,057 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,070 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:31:17,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,075 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,076 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:31:17,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:31:17,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:31:17,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:31:17,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (1/1) ... [2025-01-09 16:31:17,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:31:17,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:31:17,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:31:17,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:31:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:31:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:31:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-09 16:31:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-09 16:31:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-09 16:31:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-09 16:31:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-09 16:31:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-09 16:31:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:31:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:31:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:31:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:31:17,124 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:31:17,208 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:31:17,209 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:31:17,368 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:31:17,368 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:31:17,413 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:31:17,413 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:31:17,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:17 BoogieIcfgContainer [2025-01-09 16:31:17,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:31:17,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:31:17,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:31:17,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:31:17,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:31:16" (1/3) ... [2025-01-09 16:31:17,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d066992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:17, skipping insertion in model container [2025-01-09 16:31:17,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:31:17" (2/3) ... [2025-01-09 16:31:17,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d066992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:31:17, skipping insertion in model container [2025-01-09 16:31:17,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:17" (3/3) ... [2025-01-09 16:31:17,421 INFO L128 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2025-01-09 16:31:17,431 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:31:17,433 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe030_tso.i that has 4 procedures, 38 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 16:31:17,433 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:31:17,464 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:31:17,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 88 flow [2025-01-09 16:31:17,504 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-01-09 16:31:17,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:31:17,508 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 57 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:31:17,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 38 transitions, 88 flow [2025-01-09 16:31:17,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-01-09 16:31:17,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:31:17,523 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;@f44ffb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:31:17,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:31:17,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:31:17,531 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 16:31:17,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:31:17,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:17,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:17,532 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:31:17,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1121528242, now seen corresponding path program 1 times [2025-01-09 16:31:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:17,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-01-09 16:31:17,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:17,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:31:17,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:31:17,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:17,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:17,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777153107] [2025-01-09 16:31:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777153107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:17,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:17,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:31:17,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326355575] [2025-01-09 16:31:17,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:17,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:31:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:17,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:31:17,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:31:17,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:17,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:18,252 INFO L124 PetriNetUnfolderBase]: 1575/2837 cut-off events. [2025-01-09 16:31:18,252 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 16:31:18,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 2837 events. 1575/2837 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 18983 event pairs, 434 based on Foata normal form. 94/2885 useless extension candidates. Maximal degree in co-relation 5254. Up to 1096 conditions per place. [2025-01-09 16:31:18,270 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 30 selfloop transitions, 7 changer transitions 39/88 dead transitions. [2025-01-09 16:31:18,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 343 flow [2025-01-09 16:31:18,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:31:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:31:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 183 transitions. [2025-01-09 16:31:18,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6879699248120301 [2025-01-09 16:31:18,280 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 7 states and 183 transitions. [2025-01-09 16:31:18,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 343 flow [2025-01-09 16:31:18,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:31:18,286 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 156 flow [2025-01-09 16:31:18,287 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-01-09 16:31:18,290 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2025-01-09 16:31:18,290 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 156 flow [2025-01-09 16:31:18,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:18,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:18,290 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:31:18,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:31:18,291 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:31:18,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:18,291 INFO L85 PathProgramCache]: Analyzing trace with hash 15286515, now seen corresponding path program 1 times [2025-01-09 16:31:18,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268800045] [2025-01-09 16:31:18,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:18,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:31:18,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:31:18,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:18,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:18,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:18,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268800045] [2025-01-09 16:31:18,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268800045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:18,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:18,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54590061] [2025-01-09 16:31:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:18,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:18,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:18,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:18,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:18,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:18,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:18,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:18,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:18,802 INFO L124 PetriNetUnfolderBase]: 1395/2585 cut-off events. [2025-01-09 16:31:18,802 INFO L125 PetriNetUnfolderBase]: For 3292/3298 co-relation queries the response was YES. [2025-01-09 16:31:18,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7863 conditions, 2585 events. 1395/2585 cut-off events. For 3292/3298 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 17610 event pairs, 159 based on Foata normal form. 90/2663 useless extension candidates. Maximal degree in co-relation 7847. Up to 1010 conditions per place. [2025-01-09 16:31:18,814 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 40 selfloop transitions, 11 changer transitions 58/121 dead transitions. [2025-01-09 16:31:18,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 121 transitions, 812 flow [2025-01-09 16:31:18,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 252 transitions. [2025-01-09 16:31:18,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2025-01-09 16:31:18,817 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 156 flow. Second operand 10 states and 252 transitions. [2025-01-09 16:31:18,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 121 transitions, 812 flow [2025-01-09 16:31:18,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:31:18,825 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 266 flow [2025-01-09 16:31:18,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2025-01-09 16:31:18,826 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-01-09 16:31:18,826 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 266 flow [2025-01-09 16:31:18,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:18,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:18,827 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:31:18,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:31:18,827 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:31:18,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:18,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1796555857, now seen corresponding path program 1 times [2025-01-09 16:31:18,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395181036] [2025-01-09 16:31:18,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:18,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 16:31:18,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 16:31:18,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:18,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395181036] [2025-01-09 16:31:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395181036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:18,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:18,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:18,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135579931] [2025-01-09 16:31:18,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:18,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:18,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:18,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:18,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:18,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:18,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:18,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:19,292 INFO L124 PetriNetUnfolderBase]: 1248/2367 cut-off events. [2025-01-09 16:31:19,292 INFO L125 PetriNetUnfolderBase]: For 8290/8294 co-relation queries the response was YES. [2025-01-09 16:31:19,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8597 conditions, 2367 events. 1248/2367 cut-off events. For 8290/8294 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15831 event pairs, 226 based on Foata normal form. 67/2399 useless extension candidates. Maximal degree in co-relation 8572. Up to 954 conditions per place. [2025-01-09 16:31:19,307 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 45 selfloop transitions, 17 changer transitions 50/124 dead transitions. [2025-01-09 16:31:19,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 988 flow [2025-01-09 16:31:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 246 transitions. [2025-01-09 16:31:19,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473684210526316 [2025-01-09 16:31:19,309 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 266 flow. Second operand 10 states and 246 transitions. [2025-01-09 16:31:19,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 988 flow [2025-01-09 16:31:19,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 124 transitions, 956 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 16:31:19,326 INFO L231 Difference]: Finished difference. Result has 75 places, 54 transitions, 438 flow [2025-01-09 16:31:19,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=438, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2025-01-09 16:31:19,327 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2025-01-09 16:31:19,327 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 54 transitions, 438 flow [2025-01-09 16:31:19,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:19,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:19,327 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:19,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:31:19,327 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:31:19,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash -226134832, now seen corresponding path program 1 times [2025-01-09 16:31:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:19,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075713039] [2025-01-09 16:31:19,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:19,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:19,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 16:31:19,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 16:31:19,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:19,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:19,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:19,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075713039] [2025-01-09 16:31:19,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075713039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:19,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037904889] [2025-01-09 16:31:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:19,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:19,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:19,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:19,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 54 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:19,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:19,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:19,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:19,752 INFO L124 PetriNetUnfolderBase]: 1123/2119 cut-off events. [2025-01-09 16:31:19,752 INFO L125 PetriNetUnfolderBase]: For 12138/12144 co-relation queries the response was YES. [2025-01-09 16:31:19,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 2119 events. 1123/2119 cut-off events. For 12138/12144 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13898 event pairs, 122 based on Foata normal form. 51/2159 useless extension candidates. Maximal degree in co-relation 9050. Up to 900 conditions per place. [2025-01-09 16:31:19,767 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 44 selfloop transitions, 22 changer transitions 40/118 dead transitions. [2025-01-09 16:31:19,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 118 transitions, 1166 flow [2025-01-09 16:31:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2025-01-09 16:31:19,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6157894736842106 [2025-01-09 16:31:19,768 INFO L175 Difference]: Start difference. First operand has 75 places, 54 transitions, 438 flow. Second operand 10 states and 234 transitions. [2025-01-09 16:31:19,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 118 transitions, 1166 flow [2025-01-09 16:31:19,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 1114 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-01-09 16:31:19,790 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 620 flow [2025-01-09 16:31:19,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=620, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2025-01-09 16:31:19,791 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2025-01-09 16:31:19,791 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 62 transitions, 620 flow [2025-01-09 16:31:19,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:19,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:19,791 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:31:19,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:31:19,791 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:31:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1120916888, now seen corresponding path program 1 times [2025-01-09 16:31:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212451484] [2025-01-09 16:31:19,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:19,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:19,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:31:19,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:31:19,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:19,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:19,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212451484] [2025-01-09 16:31:19,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212451484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:19,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:19,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:31:19,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15013874] [2025-01-09 16:31:19,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:19,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:19,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:19,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:19,923 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:19,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 62 transitions, 620 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:19,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:19,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:19,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:20,217 INFO L124 PetriNetUnfolderBase]: 1300/2526 cut-off events. [2025-01-09 16:31:20,217 INFO L125 PetriNetUnfolderBase]: For 19395/19395 co-relation queries the response was YES. [2025-01-09 16:31:20,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11691 conditions, 2526 events. 1300/2526 cut-off events. For 19395/19395 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18236 event pairs, 237 based on Foata normal form. 50/2537 useless extension candidates. Maximal degree in co-relation 11648. Up to 688 conditions per place. [2025-01-09 16:31:20,232 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 48 selfloop transitions, 26 changer transitions 43/129 dead transitions. [2025-01-09 16:31:20,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 1428 flow [2025-01-09 16:31:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 239 transitions. [2025-01-09 16:31:20,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6289473684210526 [2025-01-09 16:31:20,234 INFO L175 Difference]: Start difference. First operand has 83 places, 62 transitions, 620 flow. Second operand 10 states and 239 transitions. [2025-01-09 16:31:20,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 1428 flow [2025-01-09 16:31:20,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 129 transitions, 1370 flow, removed 29 selfloop flow, removed 6 redundant places. [2025-01-09 16:31:20,252 INFO L231 Difference]: Finished difference. Result has 89 places, 62 transitions, 726 flow [2025-01-09 16:31:20,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=726, PETRI_PLACES=89, PETRI_TRANSITIONS=62} [2025-01-09 16:31:20,253 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2025-01-09 16:31:20,253 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 62 transitions, 726 flow [2025-01-09 16:31:20,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:20,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:20,253 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:31:20,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:31:20,253 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:31:20,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:20,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1816199724, now seen corresponding path program 1 times [2025-01-09 16:31:20,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:20,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556090304] [2025-01-09 16:31:20,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:20,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:20,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:31:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:31:20,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:20,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:20,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:20,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556090304] [2025-01-09 16:31:20,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556090304] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:20,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:20,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:31:20,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139744140] [2025-01-09 16:31:20,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:20,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:20,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:20,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:20,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:20,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 62 transitions, 726 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:20,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:20,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:20,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:20,693 INFO L124 PetriNetUnfolderBase]: 1473/2999 cut-off events. [2025-01-09 16:31:20,694 INFO L125 PetriNetUnfolderBase]: For 27342/27342 co-relation queries the response was YES. [2025-01-09 16:31:20,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14327 conditions, 2999 events. 1473/2999 cut-off events. For 27342/27342 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23531 event pairs, 255 based on Foata normal form. 50/2966 useless extension candidates. Maximal degree in co-relation 14294. Up to 912 conditions per place. [2025-01-09 16:31:20,715 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 46 selfloop transitions, 25 changer transitions 46/129 dead transitions. [2025-01-09 16:31:20,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 1656 flow [2025-01-09 16:31:20,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2025-01-09 16:31:20,718 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236842105263158 [2025-01-09 16:31:20,718 INFO L175 Difference]: Start difference. First operand has 89 places, 62 transitions, 726 flow. Second operand 10 states and 237 transitions. [2025-01-09 16:31:20,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 1656 flow [2025-01-09 16:31:20,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 1592 flow, removed 32 selfloop flow, removed 5 redundant places. [2025-01-09 16:31:20,745 INFO L231 Difference]: Finished difference. Result has 96 places, 61 transitions, 826 flow [2025-01-09 16:31:20,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=826, PETRI_PLACES=96, PETRI_TRANSITIONS=61} [2025-01-09 16:31:20,746 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2025-01-09 16:31:20,746 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 61 transitions, 826 flow [2025-01-09 16:31:20,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:20,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:20,746 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:31:20,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:31:20,747 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:31:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1553740880, now seen corresponding path program 1 times [2025-01-09 16:31:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765177981] [2025-01-09 16:31:20,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:20,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:31:20,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:31:20,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:20,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765177981] [2025-01-09 16:31:20,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765177981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:20,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:20,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:31:20,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980569165] [2025-01-09 16:31:20,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:20,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:20,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:20,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:20,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:20,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-09 16:31:20,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 61 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:20,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:20,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-09 16:31:20,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:21,237 INFO L124 PetriNetUnfolderBase]: 1674/3540 cut-off events. [2025-01-09 16:31:21,237 INFO L125 PetriNetUnfolderBase]: For 37032/37032 co-relation queries the response was YES. [2025-01-09 16:31:21,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16815 conditions, 3540 events. 1674/3540 cut-off events. For 37032/37032 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 30081 event pairs, 325 based on Foata normal form. 58/3535 useless extension candidates. Maximal degree in co-relation 16778. Up to 1068 conditions per place. [2025-01-09 16:31:21,259 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 41 selfloop transitions, 23 changer transitions 50/126 dead transitions. [2025-01-09 16:31:21,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 126 transitions, 1826 flow [2025-01-09 16:31:21,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:31:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:31:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2025-01-09 16:31:21,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2025-01-09 16:31:21,261 INFO L175 Difference]: Start difference. First operand has 96 places, 61 transitions, 826 flow. Second operand 10 states and 235 transitions. [2025-01-09 16:31:21,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 126 transitions, 1826 flow [2025-01-09 16:31:21,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 126 transitions, 1688 flow, removed 53 selfloop flow, removed 7 redundant places. [2025-01-09 16:31:21,301 INFO L231 Difference]: Finished difference. Result has 99 places, 56 transitions, 742 flow [2025-01-09 16:31:21,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=742, PETRI_PLACES=99, PETRI_TRANSITIONS=56} [2025-01-09 16:31:21,302 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places. [2025-01-09 16:31:21,302 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 56 transitions, 742 flow [2025-01-09 16:31:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:21,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:21,302 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-01-09 16:31:21,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:31:21,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:31:21,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:21,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1746482305, now seen corresponding path program 1 times [2025-01-09 16:31:21,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:21,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407963307] [2025-01-09 16:31:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:21,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:21,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:31:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:31:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:21,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:21,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407963307] [2025-01-09 16:31:21,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407963307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:21,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:21,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:31:21,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381709480] [2025-01-09 16:31:21,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:21,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:31:21,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:21,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:31:21,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:31:21,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 38 [2025-01-09 16:31:21,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 56 transitions, 742 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:21,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:21,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 38 [2025-01-09 16:31:21,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:21,682 INFO L124 PetriNetUnfolderBase]: 2311/4501 cut-off events. [2025-01-09 16:31:21,682 INFO L125 PetriNetUnfolderBase]: For 13456/13617 co-relation queries the response was YES. [2025-01-09 16:31:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 4501 events. 2311/4501 cut-off events. For 13456/13617 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 36444 event pairs, 634 based on Foata normal form. 237/4489 useless extension candidates. Maximal degree in co-relation 12196. Up to 1973 conditions per place. [2025-01-09 16:31:21,706 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 26 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-01-09 16:31:21,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 71 transitions, 838 flow [2025-01-09 16:31:21,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:31:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:31:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-01-09 16:31:21,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.743421052631579 [2025-01-09 16:31:21,707 INFO L175 Difference]: Start difference. First operand has 99 places, 56 transitions, 742 flow. Second operand 4 states and 113 transitions. [2025-01-09 16:31:21,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 71 transitions, 838 flow [2025-01-09 16:31:21,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 71 transitions, 745 flow, removed 16 selfloop flow, removed 13 redundant places. [2025-01-09 16:31:21,731 INFO L231 Difference]: Finished difference. Result has 85 places, 60 transitions, 687 flow [2025-01-09 16:31:21,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=687, PETRI_PLACES=85, PETRI_TRANSITIONS=60} [2025-01-09 16:31:21,731 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 43 predicate places. [2025-01-09 16:31:21,731 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 60 transitions, 687 flow [2025-01-09 16:31:21,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:21,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:21,732 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, 1] [2025-01-09 16:31:21,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:31:21,732 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:31:21,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash -924169112, now seen corresponding path program 1 times [2025-01-09 16:31:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:21,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428895831] [2025-01-09 16:31:21,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:21,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:31:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:31:21,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:21,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428895831] [2025-01-09 16:31:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428895831] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:21,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:21,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:31:21,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444366661] [2025-01-09 16:31:21,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:21,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:31:21,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:21,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:31:21,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:31:21,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 38 [2025-01-09 16:31:21,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 60 transitions, 687 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:21,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:21,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 38 [2025-01-09 16:31:21,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:22,094 INFO L124 PetriNetUnfolderBase]: 1904/3656 cut-off events. [2025-01-09 16:31:22,095 INFO L125 PetriNetUnfolderBase]: For 3336/4487 co-relation queries the response was YES. [2025-01-09 16:31:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9881 conditions, 3656 events. 1904/3656 cut-off events. For 3336/4487 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 27896 event pairs, 169 based on Foata normal form. 273/3733 useless extension candidates. Maximal degree in co-relation 9851. Up to 1820 conditions per place. [2025-01-09 16:31:22,112 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 30 selfloop transitions, 8 changer transitions 3/81 dead transitions. [2025-01-09 16:31:22,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 832 flow [2025-01-09 16:31:22,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:31:22,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:31:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-01-09 16:31:22,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7526315789473684 [2025-01-09 16:31:22,114 INFO L175 Difference]: Start difference. First operand has 85 places, 60 transitions, 687 flow. Second operand 5 states and 143 transitions. [2025-01-09 16:31:22,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 832 flow [2025-01-09 16:31:22,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 797 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-01-09 16:31:22,121 INFO L231 Difference]: Finished difference. Result has 87 places, 64 transitions, 707 flow [2025-01-09 16:31:22,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=707, PETRI_PLACES=87, PETRI_TRANSITIONS=64} [2025-01-09 16:31:22,122 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2025-01-09 16:31:22,122 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 64 transitions, 707 flow [2025-01-09 16:31:22,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:22,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:31:22,122 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, 1, 1, 1, 1] [2025-01-09 16:31:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:31:22,123 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:31:22,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:31:22,123 INFO L85 PathProgramCache]: Analyzing trace with hash -544176309, now seen corresponding path program 1 times [2025-01-09 16:31:22,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:31:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996633495] [2025-01-09 16:31:22,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:31:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:31:22,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:31:22,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:31:22,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:31:22,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:31:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:31:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:31:22,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996633495] [2025-01-09 16:31:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996633495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:31:22,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:31:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 16:31:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483333978] [2025-01-09 16:31:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:31:22,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:31:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:31:22,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:31:22,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:31:22,249 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 38 [2025-01-09 16:31:22,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 64 transitions, 707 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:22,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:31:22,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 38 [2025-01-09 16:31:22,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:31:22,516 INFO L124 PetriNetUnfolderBase]: 1648/3056 cut-off events. [2025-01-09 16:31:22,517 INFO L125 PetriNetUnfolderBase]: For 5772/8096 co-relation queries the response was YES. [2025-01-09 16:31:22,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9986 conditions, 3056 events. 1648/3056 cut-off events. For 5772/8096 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 22167 event pairs, 91 based on Foata normal form. 248/3120 useless extension candidates. Maximal degree in co-relation 9957. Up to 1324 conditions per place. [2025-01-09 16:31:22,529 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2025-01-09 16:31:22,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 79 transitions, 818 flow [2025-01-09 16:31:22,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:31:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:31:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions. [2025-01-09 16:31:22,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2025-01-09 16:31:22,531 INFO L175 Difference]: Start difference. First operand has 87 places, 64 transitions, 707 flow. Second operand 6 states and 164 transitions. [2025-01-09 16:31:22,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 79 transitions, 818 flow [2025-01-09 16:31:22,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 79 transitions, 772 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-01-09 16:31:22,536 INFO L231 Difference]: Finished difference. Result has 81 places, 0 transitions, 0 flow [2025-01-09 16:31:22,536 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=81, PETRI_TRANSITIONS=0} [2025-01-09 16:31:22,536 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2025-01-09 16:31:22,536 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 0 transitions, 0 flow [2025-01-09 16:31:22,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:31:22,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-01-09 16:31:22,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-09 16:31:22,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-09 16:31:22,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-09 16:31:22,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 16:31:22,539 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:31:22,542 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:31:22,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:31:22,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:31:22 BasicIcfg [2025-01-09 16:31:22,545 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:31:22,545 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:31:22,545 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:31:22,545 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:31:22,546 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:31:17" (3/4) ... [2025-01-09 16:31:22,547 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:31:22,549 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2025-01-09 16:31:22,549 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2025-01-09 16:31:22,549 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2025-01-09 16:31:22,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2025-01-09 16:31:22,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-09 16:31:22,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:31:22,552 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 16:31:22,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:31:22,598 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:31:22,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:31:22,598 INFO L158 Benchmark]: Toolchain (without parser) took 5925.05ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 129.2MB in the beginning and 228.3MB in the end (delta: -99.1MB). Peak memory consumption was 253.0MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.83ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 108.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.39ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: Boogie Preprocessor took 28.94ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 105.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: RCFGBuilder took 335.64ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,599 INFO L158 Benchmark]: TraceAbstraction took 5129.63ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 87.6MB in the beginning and 233.0MB in the end (delta: -145.4MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,600 INFO L158 Benchmark]: Witness Printer took 52.57ms. Allocated memory is still 520.1MB. Free memory was 233.0MB in the beginning and 228.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:31:22,604 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.19ms. Allocated memory is still 226.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.83ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 108.7MB in the end (delta: 20.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.39ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 107.7MB in the end (delta: 999.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.94ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 105.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 335.64ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5129.63ms. Allocated memory was 167.8MB in the beginning and 520.1MB in the end (delta: 352.3MB). Free memory was 87.6MB in the beginning and 233.0MB in the end (delta: -145.4MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. * Witness Printer took 52.57ms. Allocated memory is still 520.1MB. Free memory was 233.0MB in the beginning and 228.3MB in the end (delta: 4.8MB). 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 513 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 297 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 137 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=826occurred in iteration=6, InterpolantAutomatonStates: 82, 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.1s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:31:22,623 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