./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 48c9605d 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-ext/02_inc_cas.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 ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:55:30,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:55:30,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 00:55:30,850 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:55:30,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:55:30,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:55:30,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:55:30,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:55:30,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:55:30,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:55:30,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:55:30,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:55:30,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:55:30,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 00:55:30,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:55:30,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:30,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:55:30,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:55:30,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:55:30,868 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 [2025-02-08 00:55:31,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:55:31,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:55:31,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:55:31,097 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:55:31,097 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:55:31,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-08 00:55:32,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b3fea5a/f3a566259d9f479fbded7c1471c1f0fe/FLAG0aa2f1ce9 [2025-02-08 00:55:32,483 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:55:32,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/02_inc_cas.i [2025-02-08 00:55:32,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b3fea5a/f3a566259d9f479fbded7c1471c1f0fe/FLAG0aa2f1ce9 [2025-02-08 00:55:32,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08b3fea5a/f3a566259d9f479fbded7c1471c1f0fe [2025-02-08 00:55:32,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:55:32,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:55:32,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:32,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:55:32,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:55:32,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd28bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32, skipping insertion in model container [2025-02-08 00:55:32,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:55:32,763 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-ext/02_inc_cas.i[30873,30886] [2025-02-08 00:55:32,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:32,778 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:55:32,813 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-ext/02_inc_cas.i[30873,30886] [2025-02-08 00:55:32,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:55:32,843 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:55:32,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32 WrapperNode [2025-02-08 00:55:32,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:55:32,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:32,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:55:32,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:55:32,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,872 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-02-08 00:55:32,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:55:32,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:55:32,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:55:32,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:55:32,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,888 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-02-08 00:55:32,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,891 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:55:32,895 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:55:32,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:55:32,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:55:32,896 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (1/1) ... [2025-02-08 00:55:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:55:32,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:55:32,921 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-02-08 00:55:32,923 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-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 00:55:32,943 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 00:55:32,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 00:55:32,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:55:32,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 00:55:32,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 00:55:32,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 00:55:32,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:55:32,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:55:32,945 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 00:55:33,022 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:55:33,024 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:55:33,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc ~#casret~0#1.base, ~#casret~0#1.offset; [2025-02-08 00:55:33,117 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: SUMMARY for call ULTIMATE.dealloc(~#casret~0#1.base, ~#casret~0#1.offset); srcloc: null [2025-02-08 00:55:33,151 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 00:55:33,151 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:55:33,250 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:55:33,251 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:55:33,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:33 BoogieIcfgContainer [2025-02-08 00:55:33,252 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:55:33,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:55:33,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:55:33,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:55:33,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:55:32" (1/3) ... [2025-02-08 00:55:33,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d322041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:33, skipping insertion in model container [2025-02-08 00:55:33,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:55:32" (2/3) ... [2025-02-08 00:55:33,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d322041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:55:33, skipping insertion in model container [2025-02-08 00:55:33,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:55:33" (3/3) ... [2025-02-08 00:55:33,259 INFO L128 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2025-02-08 00:55:33,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:55:33,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02_inc_cas.i that has 2 procedures, 17 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-08 00:55:33,271 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 00:55:33,310 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:33,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 20 transitions, 44 flow [2025-02-08 00:55:33,350 INFO L124 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-02-08 00:55:33,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:33,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-02-08 00:55:33,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 20 transitions, 44 flow [2025-02-08 00:55:33,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 20 transitions, 44 flow [2025-02-08 00:55:33,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:33,370 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;@6b31e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:33,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 00:55:33,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:33,374 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 00:55:33,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:33,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:33,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 00:55:33,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 707392502, now seen corresponding path program 1 times [2025-02-08 00:55:33,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:33,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-02-08 00:55:33,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:33,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:33,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:33,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:33,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385510860] [2025-02-08 00:55:33,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385510860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:33,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:33,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:33,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824674077] [2025-02-08 00:55:33,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:33,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 00:55:33,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:33,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 00:55:33,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 00:55:33,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2025-02-08 00:55:33,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 20 transitions, 44 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-02-08 00:55:33,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:33,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2025-02-08 00:55:33,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:33,578 INFO L124 PetriNetUnfolderBase]: 22/61 cut-off events. [2025-02-08 00:55:33,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 00:55:33,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 61 events. 22/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 16 based on Foata normal form. 3/55 useless extension candidates. Maximal degree in co-relation 105. Up to 52 conditions per place. [2025-02-08 00:55:33,579 INFO L140 encePairwiseOnDemand]: 18/20 looper letters, 14 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2025-02-08 00:55:33,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 18 transitions, 68 flow [2025-02-08 00:55:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 00:55:33,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 00:55:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 24 transitions. [2025-02-08 00:55:33,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 00:55:33,590 INFO L175 Difference]: Start difference. First operand has 20 places, 20 transitions, 44 flow. Second operand 2 states and 24 transitions. [2025-02-08 00:55:33,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 18 transitions, 68 flow [2025-02-08 00:55:33,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 18 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:33,593 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 40 flow [2025-02-08 00:55:33,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-02-08 00:55:33,597 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2025-02-08 00:55:33,597 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 40 flow [2025-02-08 00:55:33,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-02-08 00:55:33,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:33,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 00:55:33,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:55:33,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:55:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash 707390125, now seen corresponding path program 1 times [2025-02-08 00:55:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:33,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446253103] [2025-02-08 00:55:33,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:33,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:33,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:33,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:33,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:33,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:33,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:33,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:33,654 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:33,655 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 00:55:33,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-08 00:55:33,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-08 00:55:33,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:55:33,657 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:55:33,659 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:33,659 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 00:55:33,687 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:33,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 35 transitions, 80 flow [2025-02-08 00:55:33,702 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2025-02-08 00:55:33,702 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 00:55:33,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 40 events. 6/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2025-02-08 00:55:33,703 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 35 transitions, 80 flow [2025-02-08 00:55:33,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 35 transitions, 80 flow [2025-02-08 00:55:33,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:33,706 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;@6b31e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:33,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 00:55:33,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:33,708 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 00:55:33,708 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:55:33,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:33,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 00:55:33,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 00:55:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1743244438, now seen corresponding path program 1 times [2025-02-08 00:55:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-02-08 00:55:33,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:33,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:33,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:33,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:33,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123449885] [2025-02-08 00:55:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123449885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690151316] [2025-02-08 00:55:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 00:55:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 00:55:33,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 00:55:33,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-08 00:55:33,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 80 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-02-08 00:55:33,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:33,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-08 00:55:33,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:33,936 INFO L124 PetriNetUnfolderBase]: 490/841 cut-off events. [2025-02-08 00:55:33,937 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-02-08 00:55:33,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 841 events. 490/841 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3619 event pairs, 376 based on Foata normal form. 57/714 useless extension candidates. Maximal degree in co-relation 1155. Up to 763 conditions per place. [2025-02-08 00:55:33,946 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-02-08 00:55:33,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 124 flow [2025-02-08 00:55:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 00:55:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 00:55:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-02-08 00:55:33,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 00:55:33,947 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 80 flow. Second operand 2 states and 42 transitions. [2025-02-08 00:55:33,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 124 flow [2025-02-08 00:55:33,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:33,948 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 74 flow [2025-02-08 00:55:33,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2025-02-08 00:55:33,949 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2025-02-08 00:55:33,950 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 74 flow [2025-02-08 00:55:33,950 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-02-08 00:55:33,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:33,950 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-08 00:55:33,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:55:33,950 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-02-08 00:55:33,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2061170869, now seen corresponding path program 1 times [2025-02-08 00:55:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:33,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366622602] [2025-02-08 00:55:33,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:33,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:55:33,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:55:33,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:33,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:33,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 00:55:33,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 00:55:33,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:33,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:33,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:33,980 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:33,981 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 00:55:33,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 00:55:33,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-08 00:55:33,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 00:55:33,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:55:33,981 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 00:55:33,981 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:33,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 00:55:34,010 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:34,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 50 transitions, 118 flow [2025-02-08 00:55:34,018 INFO L124 PetriNetUnfolderBase]: 9/58 cut-off events. [2025-02-08 00:55:34,018 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 00:55:34,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 58 events. 9/58 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 149 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 47. Up to 4 conditions per place. [2025-02-08 00:55:34,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 50 transitions, 118 flow [2025-02-08 00:55:34,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 50 transitions, 118 flow [2025-02-08 00:55:34,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:34,022 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;@6b31e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:34,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 00:55:34,023 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:34,023 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-08 00:55:34,023 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:55:34,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:34,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 00:55:34,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:34,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1072132984, now seen corresponding path program 1 times [2025-02-08 00:55:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:34,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161369276] [2025-02-08 00:55:34,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:34,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:34,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161369276] [2025-02-08 00:55:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161369276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595307782] [2025-02-08 00:55:34,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:34,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 00:55:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:34,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 00:55:34,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 00:55:34,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2025-02-08 00:55:34,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:34,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:34,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2025-02-08 00:55:34,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:34,747 INFO L124 PetriNetUnfolderBase]: 7132/10255 cut-off events. [2025-02-08 00:55:34,747 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-02-08 00:55:34,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20204 conditions, 10255 events. 7132/10255 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 54606 event pairs, 5560 based on Foata normal form. 786/8553 useless extension candidates. Maximal degree in co-relation 4557. Up to 9592 conditions per place. [2025-02-08 00:55:34,815 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 36 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2025-02-08 00:55:34,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 182 flow [2025-02-08 00:55:34,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 00:55:34,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 00:55:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2025-02-08 00:55:34,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 00:55:34,818 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 118 flow. Second operand 2 states and 60 transitions. [2025-02-08 00:55:34,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 182 flow [2025-02-08 00:55:34,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:34,822 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 108 flow [2025-02-08 00:55:34,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-02-08 00:55:34,823 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-02-08 00:55:34,825 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 108 flow [2025-02-08 00:55:34,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:34,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:34,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:34,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:55:34,825 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 00:55:34,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash 898880916, now seen corresponding path program 1 times [2025-02-08 00:55:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:34,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613825524] [2025-02-08 00:55:34,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:34,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:55:34,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:34,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:34,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:35,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:35,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613825524] [2025-02-08 00:55:35,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613825524] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:35,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:35,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:55:35,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209086985] [2025-02-08 00:55:35,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:35,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:55:35,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:35,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:55:35,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:55:35,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2025-02-08 00:55:35,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-02-08 00:55:35,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:35,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2025-02-08 00:55:35,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:36,588 INFO L124 PetriNetUnfolderBase]: 13598/19919 cut-off events. [2025-02-08 00:55:36,588 INFO L125 PetriNetUnfolderBase]: For 522/522 co-relation queries the response was YES. [2025-02-08 00:55:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38876 conditions, 19919 events. 13598/19919 cut-off events. For 522/522 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 122655 event pairs, 2539 based on Foata normal form. 0/15715 useless extension candidates. Maximal degree in co-relation 38870. Up to 8176 conditions per place. [2025-02-08 00:55:36,686 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 127 selfloop transitions, 13 changer transitions 0/149 dead transitions. [2025-02-08 00:55:36,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 149 transitions, 634 flow [2025-02-08 00:55:36,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-02-08 00:55:36,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-02-08 00:55:36,692 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 108 flow. Second operand 6 states and 195 transitions. [2025-02-08 00:55:36,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 149 transitions, 634 flow [2025-02-08 00:55:36,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 149 transitions, 634 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:36,698 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 192 flow [2025-02-08 00:55:36,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2025-02-08 00:55:36,699 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-02-08 00:55:36,699 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 192 flow [2025-02-08 00:55:36,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-02-08 00:55:36,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:36,700 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-08 00:55:36,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:55:36,700 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-02-08 00:55:36,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:36,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1221197932, now seen corresponding path program 1 times [2025-02-08 00:55:36,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:36,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-02-08 00:55:36,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:36,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:36,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:36,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:36,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:36,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:36,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:55:36,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:55:36,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:55:36,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:36,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:55:36,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:55:36,723 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:55:36,723 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 00:55:36,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 00:55:36,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 00:55:36,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 00:55:36,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 00:55:36,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:55:36,724 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 00:55:36,724 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 00:55:36,724 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 00:55:36,758 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 00:55:36,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 158 flow [2025-02-08 00:55:36,763 INFO L124 PetriNetUnfolderBase]: 12/76 cut-off events. [2025-02-08 00:55:36,764 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 00:55:36,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 76 events. 12/76 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 70. Up to 5 conditions per place. [2025-02-08 00:55:36,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 65 transitions, 158 flow [2025-02-08 00:55:36,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 65 transitions, 158 flow [2025-02-08 00:55:36,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:55:36,766 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;@6b31e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:55:36,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-08 00:55:36,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 00:55:36,767 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-08 00:55:36,767 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 00:55:36,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:36,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 00:55:36,767 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:36,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:36,767 INFO L85 PathProgramCache]: Analyzing trace with hash 851222632, now seen corresponding path program 1 times [2025-02-08 00:55:36,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:36,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200675707] [2025-02-08 00:55:36,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:36,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:36,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 00:55:36,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 00:55:36,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:36,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200675707] [2025-02-08 00:55:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200675707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:36,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:36,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 00:55:36,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672135632] [2025-02-08 00:55:36,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:36,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 00:55:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:36,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 00:55:36,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 00:55:36,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 65 [2025-02-08 00:55:36,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:36,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:36,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 65 [2025-02-08 00:55:36,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:42,055 INFO L124 PetriNetUnfolderBase]: 88780/116857 cut-off events. [2025-02-08 00:55:42,055 INFO L125 PetriNetUnfolderBase]: For 8838/8838 co-relation queries the response was YES. [2025-02-08 00:55:42,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231783 conditions, 116857 events. 88780/116857 cut-off events. For 8838/8838 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 695656 event pairs, 69712 based on Foata normal form. 9534/96612 useless extension candidates. Maximal degree in co-relation 20292. Up to 110923 conditions per place. [2025-02-08 00:55:42,738 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 47 selfloop transitions, 0 changer transitions 0/60 dead transitions. [2025-02-08 00:55:42,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 242 flow [2025-02-08 00:55:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 00:55:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 00:55:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2025-02-08 00:55:42,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-08 00:55:42,742 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 158 flow. Second operand 2 states and 78 transitions. [2025-02-08 00:55:42,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 242 flow [2025-02-08 00:55:42,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:42,749 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 142 flow [2025-02-08 00:55:42,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=61, 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=2, PETRI_FLOW=142, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2025-02-08 00:55:42,751 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 0 predicate places. [2025-02-08 00:55:42,752 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 142 flow [2025-02-08 00:55:42,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:55:42,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:42,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:42,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:55:42,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:42,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1203795389, now seen corresponding path program 1 times [2025-02-08 00:55:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:42,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580945885] [2025-02-08 00:55:42,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:42,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:42,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 00:55:42,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 00:55:42,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:42,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:43,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:43,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580945885] [2025-02-08 00:55:43,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580945885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:43,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:43,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:55:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006121309] [2025-02-08 00:55:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:43,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:55:43,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:43,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:55:43,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:55:43,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2025-02-08 00:55:43,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-08 00:55:43,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:43,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2025-02-08 00:55:43,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 00:55:53,780 INFO L124 PetriNetUnfolderBase]: 172436/229193 cut-off events. [2025-02-08 00:55:53,780 INFO L125 PetriNetUnfolderBase]: For 5319/5319 co-relation queries the response was YES. [2025-02-08 00:55:54,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450687 conditions, 229193 events. 172436/229193 cut-off events. For 5319/5319 co-relation queries the response was YES. Maximal size of possible extension queue 5858. Compared 1528825 event pairs, 31567 based on Foata normal form. 0/176413 useless extension candidates. Maximal degree in co-relation 450680. Up to 98389 conditions per place. [2025-02-08 00:55:55,133 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 179 selfloop transitions, 16 changer transitions 0/207 dead transitions. [2025-02-08 00:55:55,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 207 transitions, 886 flow [2025-02-08 00:55:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:55:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 00:55:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2025-02-08 00:55:55,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6871794871794872 [2025-02-08 00:55:55,135 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 142 flow. Second operand 6 states and 268 transitions. [2025-02-08 00:55:55,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 207 transitions, 886 flow [2025-02-08 00:55:55,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 207 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 00:55:55,144 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 247 flow [2025-02-08 00:55:55,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-02-08 00:55:55,145 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 8 predicate places. [2025-02-08 00:55:55,146 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 247 flow [2025-02-08 00:55:55,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-02-08 00:55:55,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 00:55:55,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:55:55,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:55:55,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-08 00:55:55,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:55:55,147 INFO L85 PathProgramCache]: Analyzing trace with hash -843748084, now seen corresponding path program 1 times [2025-02-08 00:55:55,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:55:55,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630239890] [2025-02-08 00:55:55,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:55:55,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:55:55,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:55:55,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:55:55,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:55:55,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:55:55,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:55:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:55:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630239890] [2025-02-08 00:55:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630239890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:55:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:55:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:55:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927490027] [2025-02-08 00:55:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:55:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:55:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:55:55,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:55:55,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:55:55,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 65 [2025-02-08 00:55:55,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-02-08 00:55:55,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 00:55:55,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 65 [2025-02-08 00:55:55,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand