./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-2_2-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/ldv-races/race-2_2-container_of.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 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:30:12,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:30:12,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:30:12,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:30:12,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:30:12,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:30:12,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:30:12,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:30:12,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:30:12,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:30:12,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:30:12,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:30:12,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:30:12,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:30:12,681 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:30:12,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:30:12,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:30:12,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:30:12,682 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 -> 6053c0f6a5de5dc1a7614e5acfd1de5bdb570ebc833d8c4c70a1e68bd98ac1b0 [2025-03-17 06:30:12,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:30:12,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:30:12,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:30:12,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:30:12,950 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:30:12,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-17 06:30:14,140 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73484ec87/f93825023df647fb94a1e39ce8d71ec9/FLAGbbb8b6783 [2025-03-17 06:30:14,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:30:14,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_2-container_of.i [2025-03-17 06:30:14,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73484ec87/f93825023df647fb94a1e39ce8d71ec9/FLAGbbb8b6783 [2025-03-17 06:30:14,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73484ec87/f93825023df647fb94a1e39ce8d71ec9 [2025-03-17 06:30:14,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:30:14,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:30:14,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:30:14,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:30:14,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:30:14,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:30:14" (1/1) ... [2025-03-17 06:30:14,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a97f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:14, skipping insertion in model container [2025-03-17 06:30:14,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:30:14" (1/1) ... [2025-03-17 06:30:14,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:30:14,858 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/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-17 06:30:14,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:30:14,903 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:30:14,955 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/ldv-races/race-2_2-container_of.i[186287,186300] [2025-03-17 06:30:14,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:30:15,007 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:30:15,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15 WrapperNode [2025-03-17 06:30:15,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:30:15,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:30:15,010 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:30:15,010 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:30:15,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,053 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108 [2025-03-17 06:30:15,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:30:15,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:30:15,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:30:15,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:30:15,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,088 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-03-17 06:30:15,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,105 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:30:15,119 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:30:15,120 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:30:15,120 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:30:15,121 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (1/1) ... [2025-03-17 06:30:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:30:15,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:30:15,151 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-17 06:30:15,156 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-17 06:30:15,173 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-17 06:30:15,174 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:30:15,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 06:30:15,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:30:15,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:30:15,177 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 06:30:15,374 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:30:15,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:30:15,548 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 06:30:15,549 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:30:15,656 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:30:15,657 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:30:15,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:15 BoogieIcfgContainer [2025-03-17 06:30:15,657 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:30:15,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:30:15,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:30:15,664 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:30:15,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:30:14" (1/3) ... [2025-03-17 06:30:15,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:30:15, skipping insertion in model container [2025-03-17 06:30:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:30:15" (2/3) ... [2025-03-17 06:30:15,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702f10d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:30:15, skipping insertion in model container [2025-03-17 06:30:15,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:15" (3/3) ... [2025-03-17 06:30:15,666 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2025-03-17 06:30:15,678 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:30:15,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 38 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-17 06:30:15,679 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 06:30:15,723 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 06:30:15,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 114 flow [2025-03-17 06:30:15,782 INFO L124 PetriNetUnfolderBase]: 8/63 cut-off events. [2025-03-17 06:30:15,787 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 06:30:15,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 63 events. 8/63 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 135 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 30. Up to 4 conditions per place. [2025-03-17 06:30:15,791 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 50 transitions, 114 flow [2025-03-17 06:30:15,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 98 flow [2025-03-17 06:30:15,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:30:15,813 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;@1db6a614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:30:15,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 06:30:15,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 06:30:15,818 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2025-03-17 06:30:15,819 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 06:30:15,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:15,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:15,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:15,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1189311980, now seen corresponding path program 1 times [2025-03-17 06:30:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634063404] [2025-03-17 06:30:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:15,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 06:30:15,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 06:30:15,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:16,304 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-17 06:30:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:16,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634063404] [2025-03-17 06:30:16,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634063404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:16,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:16,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:30:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962265081] [2025-03-17 06:30:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:30:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:16,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:30:16,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:30:16,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:16,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 06:30:16,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:16,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:16,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:16,568 INFO L124 PetriNetUnfolderBase]: 466/818 cut-off events. [2025-03-17 06:30:16,568 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-17 06:30:16,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1638 conditions, 818 events. 466/818 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3427 event pairs, 345 based on Foata normal form. 2/817 useless extension candidates. Maximal degree in co-relation 1539. Up to 600 conditions per place. [2025-03-17 06:30:16,575 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 38 selfloop transitions, 6 changer transitions 0/48 dead transitions. [2025-03-17 06:30:16,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 48 transitions, 196 flow [2025-03-17 06:30:16,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:30:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 06:30:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-17 06:30:16,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2025-03-17 06:30:16,593 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 98 flow. Second operand 3 states and 71 transitions. [2025-03-17 06:30:16,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 48 transitions, 196 flow [2025-03-17 06:30:16,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 06:30:16,601 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 92 flow [2025-03-17 06:30:16,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2025-03-17 06:30:16,609 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2025-03-17 06:30:16,609 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 92 flow [2025-03-17 06:30:16,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-17 06:30:16,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:16,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:16,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 06:30:16,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:16,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:16,611 INFO L85 PathProgramCache]: Analyzing trace with hash -467450151, now seen corresponding path program 1 times [2025-03-17 06:30:16,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:16,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068392332] [2025-03-17 06:30:16,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:16,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:16,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 06:30:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 06:30:16,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:16,865 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-17 06:30:16,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:16,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068392332] [2025-03-17 06:30:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068392332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:16,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:30:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339780326] [2025-03-17 06:30:16,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:16,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:30:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:16,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:30:16,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:30:16,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:16,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-17 06:30:16,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:16,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:16,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:17,106 INFO L124 PetriNetUnfolderBase]: 602/1097 cut-off events. [2025-03-17 06:30:17,107 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 06:30:17,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1097 events. 602/1097 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5313 event pairs, 289 based on Foata normal form. 69/1165 useless extension candidates. Maximal degree in co-relation 821. Up to 574 conditions per place. [2025-03-17 06:30:17,116 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 44 selfloop transitions, 8 changer transitions 4/60 dead transitions. [2025-03-17 06:30:17,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 60 transitions, 250 flow [2025-03-17 06:30:17,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:30:17,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:30:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-17 06:30:17,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-17 06:30:17,118 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 92 flow. Second operand 4 states and 90 transitions. [2025-03-17 06:30:17,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 60 transitions, 250 flow [2025-03-17 06:30:17,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:17,122 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 122 flow [2025-03-17 06:30:17,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2025-03-17 06:30:17,123 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-03-17 06:30:17,123 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 122 flow [2025-03-17 06:30:17,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-17 06:30:17,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:17,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:17,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:30:17,124 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:17,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1973633125, now seen corresponding path program 1 times [2025-03-17 06:30:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:17,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757077562] [2025-03-17 06:30:17,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:17,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 06:30:17,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 06:30:17,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:17,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:17,221 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-17 06:30:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757077562] [2025-03-17 06:30:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757077562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:17,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:17,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:30:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101372612] [2025-03-17 06:30:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:17,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:30:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:17,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:30:17,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:30:17,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50 [2025-03-17 06:30:17,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-17 06:30:17,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:17,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50 [2025-03-17 06:30:17,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:17,367 INFO L124 PetriNetUnfolderBase]: 225/404 cut-off events. [2025-03-17 06:30:17,368 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-03-17 06:30:17,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 404 events. 225/404 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1462 event pairs, 35 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 909. Up to 217 conditions per place. [2025-03-17 06:30:17,370 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 42 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-03-17 06:30:17,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 220 flow [2025-03-17 06:30:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:30:17,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 06:30:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-03-17 06:30:17,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-17 06:30:17,372 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 122 flow. Second operand 4 states and 105 transitions. [2025-03-17 06:30:17,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 220 flow [2025-03-17 06:30:17,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 214 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 06:30:17,373 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 74 flow [2025-03-17 06:30:17,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-03-17 06:30:17,374 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -9 predicate places. [2025-03-17 06:30:17,374 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 74 flow [2025-03-17 06:30:17,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-17 06:30:17,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:17,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:17,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:30:17,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1587985704, now seen corresponding path program 1 times [2025-03-17 06:30:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958081062] [2025-03-17 06:30:17,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:17,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:30:17,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:30:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:18,232 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-17 06:30:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958081062] [2025-03-17 06:30:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958081062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:18,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:18,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094200416] [2025-03-17 06:30:18,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:18,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:18,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:18,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:18,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 74 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-17 06:30:18,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:18,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:18,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:18,900 INFO L124 PetriNetUnfolderBase]: 445/820 cut-off events. [2025-03-17 06:30:18,900 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-03-17 06:30:18,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 820 events. 445/820 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3852 event pairs, 17 based on Foata normal form. 0/819 useless extension candidates. Maximal degree in co-relation 319. Up to 227 conditions per place. [2025-03-17 06:30:18,904 INFO L140 encePairwiseOnDemand]: 37/50 looper letters, 90 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2025-03-17 06:30:18,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 113 transitions, 527 flow [2025-03-17 06:30:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:30:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:30:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2025-03-17 06:30:18,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2025-03-17 06:30:18,906 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 74 flow. Second operand 14 states and 225 transitions. [2025-03-17 06:30:18,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 113 transitions, 527 flow [2025-03-17 06:30:18,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 113 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 06:30:18,908 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 216 flow [2025-03-17 06:30:18,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=216, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2025-03-17 06:30:18,911 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2025-03-17 06:30:18,911 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 216 flow [2025-03-17 06:30:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-17 06:30:18,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:18,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:18,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:30:18,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:18,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1881698852, now seen corresponding path program 2 times [2025-03-17 06:30:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909694033] [2025-03-17 06:30:18,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:30:18,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:18,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:30:18,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:30:18,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:30:18,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:19,467 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-17 06:30:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909694033] [2025-03-17 06:30:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909694033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:30:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90894147] [2025-03-17 06:30:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:19,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:30:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:30:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:30:19,481 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:19,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 216 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-17 06:30:19,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:19,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:20,052 INFO L124 PetriNetUnfolderBase]: 658/1221 cut-off events. [2025-03-17 06:30:20,052 INFO L125 PetriNetUnfolderBase]: For 1167/1167 co-relation queries the response was YES. [2025-03-17 06:30:20,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 1221 events. 658/1221 cut-off events. For 1167/1167 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6244 event pairs, 59 based on Foata normal form. 1/1222 useless extension candidates. Maximal degree in co-relation 3575. Up to 441 conditions per place. [2025-03-17 06:30:20,060 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 86 selfloop transitions, 32 changer transitions 0/120 dead transitions. [2025-03-17 06:30:20,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 773 flow [2025-03-17 06:30:20,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 06:30:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 06:30:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 207 transitions. [2025-03-17 06:30:20,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2957142857142857 [2025-03-17 06:30:20,062 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 216 flow. Second operand 14 states and 207 transitions. [2025-03-17 06:30:20,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 773 flow [2025-03-17 06:30:20,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 771 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 06:30:20,070 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 434 flow [2025-03-17 06:30:20,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=434, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2025-03-17 06:30:20,072 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2025-03-17 06:30:20,072 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 434 flow [2025-03-17 06:30:20,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-17 06:30:20,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:20,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:20,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:30:20,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:20,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:20,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1732019952, now seen corresponding path program 3 times [2025-03-17 06:30:20,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462134897] [2025-03-17 06:30:20,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:30:20,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:20,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 1 equivalence classes. [2025-03-17 06:30:20,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:30:20,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:30:20,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:20,634 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-17 06:30:20,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:20,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462134897] [2025-03-17 06:30:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462134897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173153261] [2025-03-17 06:30:20,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:20,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:20,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:20,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:20,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 434 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-17 06:30:20,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:20,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:20,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:21,312 INFO L124 PetriNetUnfolderBase]: 916/1699 cut-off events. [2025-03-17 06:30:21,312 INFO L125 PetriNetUnfolderBase]: For 3189/3189 co-relation queries the response was YES. [2025-03-17 06:30:21,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 1699 events. 916/1699 cut-off events. For 3189/3189 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9539 event pairs, 72 based on Foata normal form. 1/1700 useless extension candidates. Maximal degree in co-relation 5486. Up to 447 conditions per place. [2025-03-17 06:30:21,327 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 104 selfloop transitions, 53 changer transitions 0/159 dead transitions. [2025-03-17 06:30:21,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 159 transitions, 1204 flow [2025-03-17 06:30:21,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:30:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:30:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 272 transitions. [2025-03-17 06:30:21,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3022222222222222 [2025-03-17 06:30:21,331 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 434 flow. Second operand 18 states and 272 transitions. [2025-03-17 06:30:21,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 159 transitions, 1204 flow [2025-03-17 06:30:21,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 159 transitions, 1161 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-03-17 06:30:21,345 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 833 flow [2025-03-17 06:30:21,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=833, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-03-17 06:30:21,347 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2025-03-17 06:30:21,348 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 833 flow [2025-03-17 06:30:21,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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-17 06:30:21,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:21,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:21,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:30:21,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:21,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1651761070, now seen corresponding path program 4 times [2025-03-17 06:30:21,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:21,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875710896] [2025-03-17 06:30:21,350 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:30:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:21,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-17 06:30:21,404 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 06:30:21,404 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:30:21,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:21,906 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-17 06:30:21,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:21,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875710896] [2025-03-17 06:30:21,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875710896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:21,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:21,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:30:21,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357490197] [2025-03-17 06:30:21,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:21,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:30:21,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:21,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:30:21,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:30:21,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 833 flow. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-17 06:30:21,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:21,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:22,668 INFO L124 PetriNetUnfolderBase]: 930/1737 cut-off events. [2025-03-17 06:30:22,668 INFO L125 PetriNetUnfolderBase]: For 5820/5820 co-relation queries the response was YES. [2025-03-17 06:30:22,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6475 conditions, 1737 events. 930/1737 cut-off events. For 5820/5820 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9763 event pairs, 163 based on Foata normal form. 1/1738 useless extension candidates. Maximal degree in co-relation 6425. Up to 490 conditions per place. [2025-03-17 06:30:22,685 INFO L140 encePairwiseOnDemand]: 38/50 looper letters, 126 selfloop transitions, 54 changer transitions 0/181 dead transitions. [2025-03-17 06:30:22,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 1662 flow [2025-03-17 06:30:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:30:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:30:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 277 transitions. [2025-03-17 06:30:22,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30777777777777776 [2025-03-17 06:30:22,688 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 833 flow. Second operand 18 states and 277 transitions. [2025-03-17 06:30:22,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 1662 flow [2025-03-17 06:30:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 181 transitions, 1600 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-17 06:30:22,714 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 1135 flow [2025-03-17 06:30:22,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1135, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2025-03-17 06:30:22,716 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places. [2025-03-17 06:30:22,716 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 1135 flow [2025-03-17 06:30:22,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 11 states have internal predecessors, (112), 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-17 06:30:22,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:22,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:22,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:30:22,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:22,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1697927470, now seen corresponding path program 1 times [2025-03-17 06:30:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:22,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252926741] [2025-03-17 06:30:22,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:30:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:22,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:22,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:22,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:23,473 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-17 06:30:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252926741] [2025-03-17 06:30:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252926741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864852932] [2025-03-17 06:30:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:23,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:23,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:23,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:23,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 1135 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:23,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:23,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:23,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:24,251 INFO L124 PetriNetUnfolderBase]: 1160/2159 cut-off events. [2025-03-17 06:30:24,251 INFO L125 PetriNetUnfolderBase]: For 11113/11113 co-relation queries the response was YES. [2025-03-17 06:30:24,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8739 conditions, 2159 events. 1160/2159 cut-off events. For 11113/11113 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12735 event pairs, 411 based on Foata normal form. 1/2160 useless extension candidates. Maximal degree in co-relation 8185. Up to 1616 conditions per place. [2025-03-17 06:30:24,266 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 102 selfloop transitions, 69 changer transitions 44/216 dead transitions. [2025-03-17 06:30:24,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 216 transitions, 2627 flow [2025-03-17 06:30:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 06:30:24,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-17 06:30:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 250 transitions. [2025-03-17 06:30:24,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2025-03-17 06:30:24,268 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 1135 flow. Second operand 18 states and 250 transitions. [2025-03-17 06:30:24,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 216 transitions, 2627 flow [2025-03-17 06:30:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 216 transitions, 2448 flow, removed 36 selfloop flow, removed 8 redundant places. [2025-03-17 06:30:24,297 INFO L231 Difference]: Finished difference. Result has 132 places, 146 transitions, 1860 flow [2025-03-17 06:30:24,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1860, PETRI_PLACES=132, PETRI_TRANSITIONS=146} [2025-03-17 06:30:24,299 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 87 predicate places. [2025-03-17 06:30:24,299 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 146 transitions, 1860 flow [2025-03-17 06:30:24,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:24,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:24,300 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:24,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:30:24,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:24,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1352995772, now seen corresponding path program 2 times [2025-03-17 06:30:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:24,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138636824] [2025-03-17 06:30:24,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 06:30:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:24,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:24,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:24,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:30:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:24,879 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-17 06:30:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138636824] [2025-03-17 06:30:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138636824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393267081] [2025-03-17 06:30:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:24,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:24,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:24,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:24,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 146 transitions, 1860 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:24,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:24,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:24,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:25,773 INFO L124 PetriNetUnfolderBase]: 1443/2744 cut-off events. [2025-03-17 06:30:25,773 INFO L125 PetriNetUnfolderBase]: For 16063/16063 co-relation queries the response was YES. [2025-03-17 06:30:25,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12219 conditions, 2744 events. 1443/2744 cut-off events. For 16063/16063 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 17672 event pairs, 454 based on Foata normal form. 2/2746 useless extension candidates. Maximal degree in co-relation 12133. Up to 1704 conditions per place. [2025-03-17 06:30:25,796 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 149 selfloop transitions, 101 changer transitions 36/287 dead transitions. [2025-03-17 06:30:25,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 287 transitions, 3779 flow [2025-03-17 06:30:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 06:30:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 06:30:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 277 transitions. [2025-03-17 06:30:25,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29157894736842105 [2025-03-17 06:30:25,799 INFO L175 Difference]: Start difference. First operand has 132 places, 146 transitions, 1860 flow. Second operand 19 states and 277 transitions. [2025-03-17 06:30:25,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 287 transitions, 3779 flow [2025-03-17 06:30:25,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 287 transitions, 3592 flow, removed 79 selfloop flow, removed 9 redundant places. [2025-03-17 06:30:25,855 INFO L231 Difference]: Finished difference. Result has 141 places, 198 transitions, 2728 flow [2025-03-17 06:30:25,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2728, PETRI_PLACES=141, PETRI_TRANSITIONS=198} [2025-03-17 06:30:25,855 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2025-03-17 06:30:25,855 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 198 transitions, 2728 flow [2025-03-17 06:30:25,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:25,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:25,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:30:25,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:25,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1274688076, now seen corresponding path program 3 times [2025-03-17 06:30:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080228424] [2025-03-17 06:30:25,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 06:30:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:25,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:25,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:25,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 06:30:25,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:26,431 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-17 06:30:26,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080228424] [2025-03-17 06:30:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080228424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:26,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:26,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89507488] [2025-03-17 06:30:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:26,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:26,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:26,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:26,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 198 transitions, 2728 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:26,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:26,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:26,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:27,482 INFO L124 PetriNetUnfolderBase]: 1477/2846 cut-off events. [2025-03-17 06:30:27,482 INFO L125 PetriNetUnfolderBase]: For 18076/18076 co-relation queries the response was YES. [2025-03-17 06:30:27,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13141 conditions, 2846 events. 1477/2846 cut-off events. For 18076/18076 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18660 event pairs, 520 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 13044. Up to 1953 conditions per place. [2025-03-17 06:30:27,503 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 176 selfloop transitions, 106 changer transitions 28/311 dead transitions. [2025-03-17 06:30:27,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 311 transitions, 4203 flow [2025-03-17 06:30:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 06:30:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-17 06:30:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 325 transitions. [2025-03-17 06:30:27,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2826086956521739 [2025-03-17 06:30:27,505 INFO L175 Difference]: Start difference. First operand has 141 places, 198 transitions, 2728 flow. Second operand 23 states and 325 transitions. [2025-03-17 06:30:27,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 311 transitions, 4203 flow [2025-03-17 06:30:27,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 311 transitions, 4015 flow, removed 75 selfloop flow, removed 5 redundant places. [2025-03-17 06:30:27,565 INFO L231 Difference]: Finished difference. Result has 167 places, 223 transitions, 3258 flow [2025-03-17 06:30:27,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2600, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3258, PETRI_PLACES=167, PETRI_TRANSITIONS=223} [2025-03-17 06:30:27,567 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 122 predicate places. [2025-03-17 06:30:27,567 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 223 transitions, 3258 flow [2025-03-17 06:30:27,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:27,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:27,568 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:27,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:30:27,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:27,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:27,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1403183082, now seen corresponding path program 4 times [2025-03-17 06:30:27,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:27,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532825417] [2025-03-17 06:30:27,569 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 06:30:27,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:27,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-17 06:30:27,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:27,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 06:30:27,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:28,240 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-17 06:30:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532825417] [2025-03-17 06:30:28,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532825417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:28,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:28,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507038431] [2025-03-17 06:30:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:28,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:28,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:28,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:28,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:28,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:28,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 223 transitions, 3258 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:28,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:28,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:28,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:29,291 INFO L124 PetriNetUnfolderBase]: 1681/3372 cut-off events. [2025-03-17 06:30:29,292 INFO L125 PetriNetUnfolderBase]: For 22857/22857 co-relation queries the response was YES. [2025-03-17 06:30:29,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15808 conditions, 3372 events. 1681/3372 cut-off events. For 22857/22857 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23838 event pairs, 645 based on Foata normal form. 2/3374 useless extension candidates. Maximal degree in co-relation 15668. Up to 2010 conditions per place. [2025-03-17 06:30:29,320 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 206 selfloop transitions, 119 changer transitions 35/361 dead transitions. [2025-03-17 06:30:29,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 361 transitions, 5228 flow [2025-03-17 06:30:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 06:30:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 06:30:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 309 transitions. [2025-03-17 06:30:29,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29428571428571426 [2025-03-17 06:30:29,322 INFO L175 Difference]: Start difference. First operand has 167 places, 223 transitions, 3258 flow. Second operand 21 states and 309 transitions. [2025-03-17 06:30:29,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 361 transitions, 5228 flow [2025-03-17 06:30:29,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 361 transitions, 5134 flow, removed 32 selfloop flow, removed 6 redundant places. [2025-03-17 06:30:29,412 INFO L231 Difference]: Finished difference. Result has 186 places, 259 transitions, 4046 flow [2025-03-17 06:30:29,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4046, PETRI_PLACES=186, PETRI_TRANSITIONS=259} [2025-03-17 06:30:29,413 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 141 predicate places. [2025-03-17 06:30:29,413 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 259 transitions, 4046 flow [2025-03-17 06:30:29,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:29,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:29,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:29,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:30:29,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:29,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1310677458, now seen corresponding path program 5 times [2025-03-17 06:30:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:29,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392112542] [2025-03-17 06:30:29,414 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 06:30:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:29,428 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:29,441 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:29,441 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 06:30:29,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:30:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 06:30:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:30:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392112542] [2025-03-17 06:30:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392112542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:30:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:30:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:30:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550725619] [2025-03-17 06:30:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:30:29,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:30:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:30:29,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:30:29,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:30:29,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 50 [2025-03-17 06:30:29,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 259 transitions, 4046 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:29,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 06:30:29,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 50 [2025-03-17 06:30:29,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 06:30:30,861 INFO L124 PetriNetUnfolderBase]: 1563/3172 cut-off events. [2025-03-17 06:30:30,861 INFO L125 PetriNetUnfolderBase]: For 25052/25052 co-relation queries the response was YES. [2025-03-17 06:30:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 3172 events. 1563/3172 cut-off events. For 25052/25052 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22234 event pairs, 632 based on Foata normal form. 1/3173 useless extension candidates. Maximal degree in co-relation 15738. Up to 2301 conditions per place. [2025-03-17 06:30:30,917 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 116 changer transitions 39/336 dead transitions. [2025-03-17 06:30:30,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 336 transitions, 5134 flow [2025-03-17 06:30:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 06:30:30,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 06:30:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 311 transitions. [2025-03-17 06:30:30,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2827272727272727 [2025-03-17 06:30:30,919 INFO L175 Difference]: Start difference. First operand has 186 places, 259 transitions, 4046 flow. Second operand 22 states and 311 transitions. [2025-03-17 06:30:30,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 336 transitions, 5134 flow [2025-03-17 06:30:31,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 336 transitions, 4979 flow, removed 54 selfloop flow, removed 7 redundant places. [2025-03-17 06:30:31,010 INFO L231 Difference]: Finished difference. Result has 202 places, 253 transitions, 4048 flow [2025-03-17 06:30:31,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3903, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4048, PETRI_PLACES=202, PETRI_TRANSITIONS=253} [2025-03-17 06:30:31,012 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 157 predicate places. [2025-03-17 06:30:31,012 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 253 transitions, 4048 flow [2025-03-17 06:30:31,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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-17 06:30:31,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 06:30:31,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:30:31,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:30:31,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-17 06:30:31,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:30:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 627589884, now seen corresponding path program 6 times [2025-03-17 06:30:31,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:30:31,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558077072] [2025-03-17 06:30:31,014 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 06:30:31,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:30:31,025 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:31,033 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:31,033 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 06:30:31,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:30:31,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:30:31,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 06:30:31,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 06:30:31,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:30:31,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:30:31,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:30:31,075 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:30:31,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-17 06:30:31,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-17 06:30:31,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-17 06:30:31,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-17 06:30:31,078 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-17 06:30:31,079 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-17 06:30:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:30:31,079 INFO L422 BasicCegarLoop]: Path program histogram: [6, 4, 1, 1, 1] [2025-03-17 06:30:31,122 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 06:30:31,123 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:30:31,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:30:31 BasicIcfg [2025-03-17 06:30:31,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:30:31,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:30:31,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:30:31,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:30:31,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:30:15" (3/4) ... [2025-03-17 06:30:31,130 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 06:30:31,180 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-03-17 06:30:31,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 06:30:31,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 06:30:31,217 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:30:31,217 INFO L158 Benchmark]: Toolchain (without parser) took 16640.24ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 103.6MB in the beginning and 440.6MB in the end (delta: -337.0MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,218 INFO L158 Benchmark]: CDTParser took 2.64ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:30:31,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.75ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 72.9MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.60ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:30:31,219 INFO L158 Benchmark]: Boogie Preprocessor took 63.42ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 67.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,219 INFO L158 Benchmark]: IcfgBuilder took 537.90ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 98.9MB in the end (delta: -31.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,219 INFO L158 Benchmark]: TraceAbstraction took 15468.68ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 98.2MB in the beginning and 453.2MB in the end (delta: -355.0MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,220 INFO L158 Benchmark]: Witness Printer took 88.19ms. Allocated memory is still 587.2MB. Free memory was 453.2MB in the beginning and 440.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:30:31,221 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.64ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.75ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 72.9MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.60ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 70.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.42ms. Allocated memory is still 142.6MB. Free memory was 70.8MB in the beginning and 67.2MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 537.90ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 98.9MB in the end (delta: -31.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15468.68ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 98.2MB in the beginning and 453.2MB in the end (delta: -355.0MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. * Witness Printer took 88.19ms. Allocated memory is still 587.2MB. Free memory was 453.2MB in the beginning and 440.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3950] CALL, EXPR 0 my_drv_init() [L3944] 0 return 0; [L3950] RET, EXPR 0 my_drv_init() [L3950] 0 int ret = my_drv_init(); [L3951] COND TRUE 0 ret==0 [L3952] 0 int probe_ret; [L3953] 0 struct my_data data; [L3954] CALL, EXPR 0 my_drv_probe(&data) [L3920] 0 struct device *d = &data->dev; [L3924] 0 data->shared.a = 0 [L3925] 0 data->shared.b = 0 [L3926] 0 int res = __VERIFIER_nondet_int(); [L3927] COND FALSE 0 !(\read(res)) [L3930] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, d={5:24}, data={5:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3931] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={5:24}, \old(data)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1=-1, t2=0] [L3932] 0 return 0; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result=0, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 1 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3917] 1 return 0; [L3954] RET, EXPR 0 my_drv_probe(&data) [L3954] 0 probe_ret = my_drv_probe(&data) [L3914] 2 data->shared.b = lb + 1 VAL [\old(arg)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0] [L3955] COND TRUE 0 probe_ret==0 [L3956] CALL 0 my_drv_disconnect(&data) [L3938] 0 void *status; VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3917] 2 return 0; [L3939] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3940] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\old(arg)={5:24}, \old(data)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0] [L3956] RET 0 my_drv_disconnect(&data) [L3957] EXPR 0 data.shared.a [L3957] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) VAL [\old(arg)={5:24}, \old(expression)=1, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=1, lb=0, t1=-1, t2=0] [L3957] RET 0 ldv_assert(data.shared.a==1) [L3958] EXPR 0 data.shared.b [L3958] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\old(arg)={5:24}, \old(expression)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3931]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 52 locations, 59 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1382 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1334 mSDsluCounter, 1364 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1312 mSDsCounter, 186 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5581 IncrementalHoareTripleChecker+Invalid, 5767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 186 mSolverCounterUnsat, 52 mSDtfsCounter, 5581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4048occurred in iteration=12, InterpolantAutomatonStates: 178, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 296 NumberOfCodeBlocks, 296 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 257 ConstructedInterpolants, 0 QuantifiedInterpolants, 3178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 06:30:31,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE