./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/02_inc_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/02_inc_cas.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:02:16,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:02:16,098 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:02:16,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:02:16,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:02:16,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:02:16,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:02:16,128 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:02:16,128 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:02:16,128 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:02:16,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:02:16,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:02:16,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:02:16,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:02:16,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:16,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:02:16,130 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-03-04 02:02:16,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:02:16,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:02:16,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:02:16,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:02:16,323 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:02:16,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-04 02:02:17,421 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fd6595/9537e732e5ca4455bb0b7d0fca2c8731/FLAG00052b6a2 [2025-03-04 02:02:17,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:02:17,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-03-04 02:02:17,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fd6595/9537e732e5ca4455bb0b7d0fca2c8731/FLAG00052b6a2 [2025-03-04 02:02:17,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9fd6595/9537e732e5ca4455bb0b7d0fca2c8731 [2025-03-04 02:02:17,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:02:17,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:02:17,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:17,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:02:17,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:02:17,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:17" (1/1) ... [2025-03-04 02:02:17,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3b6ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:17, skipping insertion in model container [2025-03-04 02:02:17,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:02:17" (1/1) ... [2025-03-04 02:02:17,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:02:17,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2025-03-04 02:02:17,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:17,970 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:02:17,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i[30873,30886] [2025-03-04 02:02:18,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:02:18,022 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:02:18,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18 WrapperNode [2025-03-04 02:02:18,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:02:18,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:18,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:02:18,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:02:18,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,054 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-03-04 02:02:18,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:02:18,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:02:18,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:02:18,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:02:18,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,077 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 3, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 3 writes are split as follows [0, 2, 1]. [2025-03-04 02:02:18,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:02:18,097 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:02:18,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:02:18,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:02:18,098 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (1/1) ... [2025-03-04 02:02:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:02:18,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:02:18,126 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:02:18,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 02:02:18,144 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 02:02:18,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 02:02:18,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:02:18,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:02:18,146 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:02:18,247 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:02:18,249 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:02:18,324 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-03-04 02:02:18,324 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-03-04 02:02:18,355 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:02:18,355 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:02:18,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:02:18,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:02:18,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:18 BoogieIcfgContainer [2025-03-04 02:02:18,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:02:18,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:02:18,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:02:18,451 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:02:18,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:02:17" (1/3) ... [2025-03-04 02:02:18,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129e5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:18, skipping insertion in model container [2025-03-04 02:02:18,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:02:18" (2/3) ... [2025-03-04 02:02:18,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129e5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:02:18, skipping insertion in model container [2025-03-04 02:02:18,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:02:18" (3/3) ... [2025-03-04 02:02:18,453 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-03-04 02:02:18,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:02:18,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:02:18,465 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:02:18,502 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:18,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 19 transitions, 42 flow [2025-03-04 02:02:18,541 INFO L124 PetriNetUnfolderBase]: 3/21 cut-off events. [2025-03-04 02:02:18,543 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:18,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2025-03-04 02:02:18,545 INFO L82 GeneralOperation]: Start removeDead. Operand has 19 places, 19 transitions, 42 flow [2025-03-04 02:02:18,547 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 19 transitions, 42 flow [2025-03-04 02:02:18,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:18,566 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;@341a0833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:18,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-04 02:02:18,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:18,574 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:02:18,574 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:18,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:18,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:02:18,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:18,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:18,581 INFO L85 PathProgramCache]: Analyzing trace with hash 676824918, now seen corresponding path program 1 times [2025-03-04 02:02:18,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:18,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946058847] [2025-03-04 02:02:18,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:18,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:18,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:18,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:18,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:18,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:18,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:18,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946058847] [2025-03-04 02:02:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946058847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:18,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826005143] [2025-03-04 02:02:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:02:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:18,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:02:18,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:02:18,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2025-03-04 02:02:18,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 19 transitions, 42 flow. Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03-04 02:02:18,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:18,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2025-03-04 02:02:18,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:18,766 INFO L124 PetriNetUnfolderBase]: 22/58 cut-off events. [2025-03-04 02:02:18,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:02:18,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 58 events. 22/58 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 16 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 102. Up to 52 conditions per place. [2025-03-04 02:02:18,768 INFO L140 encePairwiseOnDemand]: 17/19 looper letters, 14 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2025-03-04 02:02:18,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 17 transitions, 66 flow [2025-03-04 02:02:18,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:02:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:02:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2025-03-04 02:02:18,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2025-03-04 02:02:18,781 INFO L175 Difference]: Start difference. First operand has 19 places, 19 transitions, 42 flow. Second operand 2 states and 22 transitions. [2025-03-04 02:02:18,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 17 transitions, 66 flow [2025-03-04 02:02:18,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 66 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:18,785 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 38 flow [2025-03-04 02:02:18,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2025-03-04 02:02:18,788 INFO L279 CegarLoopForPetriNet]: 19 programPoint places, 0 predicate places. [2025-03-04 02:02:18,788 INFO L471 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 38 flow [2025-03-04 02:02:18,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-03-04 02:02:18,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:18,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 02:02:18,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:02:18,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 02:02:18,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 676823533, now seen corresponding path program 1 times [2025-03-04 02:02:18,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:18,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952930386] [2025-03-04 02:02:18,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:18,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:18,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:18,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:18,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:18,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:18,807 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:18,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:18,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:18,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:18,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:18,827 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:18,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-03-04 02:02:18,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-03-04 02:02:18,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-03-04 02:02:18,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:02:18,837 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:02:18,840 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:18,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 02:02:18,862 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:18,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 33 transitions, 76 flow [2025-03-04 02:02:18,870 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-04 02:02:18,870 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:02:18,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 38 events. 6/38 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 90 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 3 conditions per place. [2025-03-04 02:02:18,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 33 transitions, 76 flow [2025-03-04 02:02:18,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 33 transitions, 76 flow [2025-03-04 02:02:18,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:18,872 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;@341a0833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:18,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:02:18,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:18,875 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:02:18,875 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:02:18,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:18,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:02:18,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:18,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1653479158, now seen corresponding path program 1 times [2025-03-04 02:02:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345687782] [2025-03-04 02:02:18,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:18,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:18,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:18,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:18,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:18,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345687782] [2025-03-04 02:02:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345687782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:18,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:18,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054078461] [2025-03-04 02:02:18,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:02:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:18,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:02:18,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:02:18,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-03-04 02:02:18,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 76 flow. Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-03-04 02:02:18,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:18,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-03-04 02:02:18,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:19,044 INFO L124 PetriNetUnfolderBase]: 490/822 cut-off events. [2025-03-04 02:02:19,044 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 02:02:19,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 822 events. 490/822 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3298 event pairs, 376 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 1143. Up to 763 conditions per place. [2025-03-04 02:02:19,052 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 25 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-03-04 02:02:19,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 120 flow [2025-03-04 02:02:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:02:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:02:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2025-03-04 02:02:19,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-04 02:02:19,054 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 76 flow. Second operand 2 states and 38 transitions. [2025-03-04 02:02:19,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 120 flow [2025-03-04 02:02:19,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:19,056 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 70 flow [2025-03-04 02:02:19,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-04 02:02:19,057 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2025-03-04 02:02:19,057 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 70 flow [2025-03-04 02:02:19,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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-03-04 02:02:19,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:19,058 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 02:02:19,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:02:19,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-03-04 02:02:19,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:19,058 INFO L85 PathProgramCache]: Analyzing trace with hash -607525168, now seen corresponding path program 1 times [2025-03-04 02:02:19,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:19,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948042656] [2025-03-04 02:02:19,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:19,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:19,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:02:19,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:02:19,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:19,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:19,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 02:02:19,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 02:02:19,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:19,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:19,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:19,093 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:19,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-03-04 02:02:19,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-03-04 02:02:19,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-03-04 02:02:19,093 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-03-04 02:02:19,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:02:19,093 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 02:02:19,094 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:19,094 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 02:02:19,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 47 transitions, 112 flow [2025-03-04 02:02:19,133 INFO L124 PetriNetUnfolderBase]: 9/55 cut-off events. [2025-03-04 02:02:19,133 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:02:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 9/55 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 138 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2025-03-04 02:02:19,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 47 transitions, 112 flow [2025-03-04 02:02:19,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2025-03-04 02:02:19,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:19,137 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;@341a0833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:19,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:02:19,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:19,139 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-03-04 02:02:19,139 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:02:19,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:19,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:02:19,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:19,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1250678423, now seen corresponding path program 1 times [2025-03-04 02:02:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:19,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972950825] [2025-03-04 02:02:19,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:19,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:19,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:19,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:19,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:19,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:19,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:19,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972950825] [2025-03-04 02:02:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972950825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:19,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642590894] [2025-03-04 02:02:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:19,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:02:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:19,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:02:19,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:02:19,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 47 [2025-03-04 02:02:19,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-03-04 02:02:19,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:19,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 47 [2025-03-04 02:02:19,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:19,821 INFO L124 PetriNetUnfolderBase]: 7132/10110 cut-off events. [2025-03-04 02:02:19,822 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2025-03-04 02:02:19,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20059 conditions, 10110 events. 7132/10110 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 50498 event pairs, 5560 based on Foata normal form. 0/7656 useless extension candidates. Maximal degree in co-relation 4545. Up to 9592 conditions per place. [2025-03-04 02:02:19,881 INFO L140 encePairwiseOnDemand]: 43/47 looper letters, 36 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2025-03-04 02:02:19,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 176 flow [2025-03-04 02:02:19,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:02:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:02:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2025-03-04 02:02:19,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.574468085106383 [2025-03-04 02:02:19,884 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 112 flow. Second operand 2 states and 54 transitions. [2025-03-04 02:02:19,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 176 flow [2025-03-04 02:02:19,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:19,886 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 102 flow [2025-03-04 02:02:19,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-04 02:02:19,886 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2025-03-04 02:02:19,886 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 102 flow [2025-03-04 02:02:19,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-03-04 02:02:19,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:19,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:19,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:02:19,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:19,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:19,887 INFO L85 PathProgramCache]: Analyzing trace with hash 625423299, now seen corresponding path program 1 times [2025-03-04 02:02:19,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:19,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366969553] [2025-03-04 02:02:19,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:19,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:19,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:02:19,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:02:19,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:19,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:20,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:20,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366969553] [2025-03-04 02:02:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366969553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:20,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:02:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210988614] [2025-03-04 02:02:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:20,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:20,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:20,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:20,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 47 [2025-03-04 02:02:20,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 102 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:20,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:20,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 47 [2025-03-04 02:02:20,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:21,628 INFO L124 PetriNetUnfolderBase]: 13598/19312 cut-off events. [2025-03-04 02:02:21,629 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2025-03-04 02:02:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38269 conditions, 19312 events. 13598/19312 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 108751 event pairs, 2539 based on Foata normal form. 0/15124 useless extension candidates. Maximal degree in co-relation 38263. Up to 8176 conditions per place. [2025-03-04 02:02:21,719 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 127 selfloop transitions, 13 changer transitions 0/146 dead transitions. [2025-03-04 02:02:21,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 146 transitions, 628 flow [2025-03-04 02:02:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 177 transitions. [2025-03-04 02:02:21,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2025-03-04 02:02:21,721 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 102 flow. Second operand 6 states and 177 transitions. [2025-03-04 02:02:21,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 146 transitions, 628 flow [2025-03-04 02:02:21,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 146 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:21,725 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 186 flow [2025-03-04 02:02:21,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2025-03-04 02:02:21,726 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2025-03-04 02:02:21,726 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 186 flow [2025-03-04 02:02:21,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:02:21,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:21,726 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 02:02:21,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:02:21,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:02:21,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:21,727 INFO L85 PathProgramCache]: Analyzing trace with hash 287003052, now seen corresponding path program 1 times [2025-03-04 02:02:21,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:21,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624678344] [2025-03-04 02:02:21,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:21,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:21,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:02:21,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:02:21,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:21,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:21,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 02:02:21,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 02:02:21,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 02:02:21,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:21,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 02:02:21,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 02:02:21,754 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 02:02:21,754 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:02:21,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:02:21,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:02:21,754 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:02:21,755 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:02:21,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:02:21,755 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 02:02:21,755 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 02:02:21,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 02:02:21,790 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:02:21,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 61 transitions, 150 flow [2025-03-04 02:02:21,799 INFO L124 PetriNetUnfolderBase]: 12/72 cut-off events. [2025-03-04 02:02:21,800 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 02:02:21,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 72 events. 12/72 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 213 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2025-03-04 02:02:21,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 61 transitions, 150 flow [2025-03-04 02:02:21,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 61 transitions, 150 flow [2025-03-04 02:02:21,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:02:21,802 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;@341a0833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:02:21,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:02:21,804 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:02:21,805 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 02:02:21,805 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:02:21,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:21,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 02:02:21,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:02:21,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:21,805 INFO L85 PathProgramCache]: Analyzing trace with hash 554312585, now seen corresponding path program 1 times [2025-03-04 02:02:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:21,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608324432] [2025-03-04 02:02:21,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:21,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 02:02:21,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 02:02:21,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:21,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:21,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608324432] [2025-03-04 02:02:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608324432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:21,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 02:02:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654465106] [2025-03-04 02:02:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 02:02:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:21,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 02:02:21,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 02:02:21,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 61 [2025-03-04 02:02:21,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 150 flow. Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-03-04 02:02:21,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:21,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 61 [2025-03-04 02:02:21,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:26,782 INFO L124 PetriNetUnfolderBase]: 88780/115578 cut-off events. [2025-03-04 02:02:26,782 INFO L125 PetriNetUnfolderBase]: For 8842/8842 co-relation queries the response was YES. [2025-03-04 02:02:26,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230504 conditions, 115578 events. 88780/115578 cut-off events. For 8842/8842 co-relation queries the response was YES. Maximal size of possible extension queue 2631. Compared 648249 event pairs, 69712 based on Foata normal form. 0/86097 useless extension candidates. Maximal degree in co-relation 20145. Up to 110923 conditions per place. [2025-03-04 02:02:27,413 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 47 selfloop transitions, 0 changer transitions 0/56 dead transitions. [2025-03-04 02:02:27,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 234 flow [2025-03-04 02:02:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 02:02:27,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 02:02:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2025-03-04 02:02:27,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5737704918032787 [2025-03-04 02:02:27,415 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 150 flow. Second operand 2 states and 70 transitions. [2025-03-04 02:02:27,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 234 flow [2025-03-04 02:02:27,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 228 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:27,427 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 134 flow [2025-03-04 02:02:27,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2025-03-04 02:02:27,428 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2025-03-04 02:02:27,428 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 134 flow [2025-03-04 02:02:27,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-03-04 02:02:27,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:27,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:27,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:02:27,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:02:27,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2093621149, now seen corresponding path program 1 times [2025-03-04 02:02:27,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432214724] [2025-03-04 02:02:27,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:27,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:27,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:02:27,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:02:27,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:27,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:27,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432214724] [2025-03-04 02:02:27,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432214724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:27,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:27,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:02:27,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889245853] [2025-03-04 02:02:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:27,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:27,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:27,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:27,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-04 02:02:27,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:02:27,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:27,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-04 02:02:27,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:02:37,517 INFO L124 PetriNetUnfolderBase]: 172436/224851 cut-off events. [2025-03-04 02:02:37,517 INFO L125 PetriNetUnfolderBase]: For 5323/5323 co-relation queries the response was YES. [2025-03-04 02:02:37,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446345 conditions, 224851 events. 172436/224851 cut-off events. For 5323/5323 co-relation queries the response was YES. Maximal size of possible extension queue 5289. Compared 1386635 event pairs, 31567 based on Foata normal form. 0/172207 useless extension candidates. Maximal degree in co-relation 446338. Up to 98389 conditions per place. [2025-03-04 02:02:38,565 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 179 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2025-03-04 02:02:38,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 203 transitions, 878 flow [2025-03-04 02:02:38,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:02:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:02:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2025-03-04 02:02:38,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 02:02:38,567 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 134 flow. Second operand 6 states and 244 transitions. [2025-03-04 02:02:38,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 203 transitions, 878 flow [2025-03-04 02:02:38,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 203 transitions, 878 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:02:38,572 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 239 flow [2025-03-04 02:02:38,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2025-03-04 02:02:38,572 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2025-03-04 02:02:38,572 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 239 flow [2025-03-04 02:02:38,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-03-04 02:02:38,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:02:38,573 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:02:38,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:02:38,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:02:38,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:02:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -23412423, now seen corresponding path program 1 times [2025-03-04 02:02:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:02:38,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559125840] [2025-03-04 02:02:38,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:02:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:02:38,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 02:02:38,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 02:02:38,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:02:38,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:02:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:02:38,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:02:38,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559125840] [2025-03-04 02:02:38,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559125840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:02:38,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:02:38,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:02:38,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351879449] [2025-03-04 02:02:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:02:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:02:38,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:02:38,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:02:38,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:02:38,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 61 [2025-03-04 02:02:38,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 239 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-03-04 02:02:38,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:02:38,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 61 [2025-03-04 02:02:38,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand