./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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-3_1-container_of-global.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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:54:50,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:54:50,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:54:50,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:54:50,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:54:50,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:54:50,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:54:50,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:54:50,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:54:50,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:54:50,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:54:50,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:54:50,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:54:50,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:54:50,342 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:54:50,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:54:50,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:54:50,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:54:50,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:54:50,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:50,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:54:50,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:54:50,344 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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2025-03-14 00:54:50,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:54:50,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:54:50,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:54:50,559 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:54:50,559 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:54:50,560 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-14 00:54:51,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762cdfa88/7433618f61a14cac8371d3b6b46f9394/FLAG8e0a6bf5c [2025-03-14 00:54:52,063 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:54:52,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2025-03-14 00:54:52,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762cdfa88/7433618f61a14cac8371d3b6b46f9394/FLAG8e0a6bf5c [2025-03-14 00:54:52,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/762cdfa88/7433618f61a14cac8371d3b6b46f9394 [2025-03-14 00:54:52,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:54:52,115 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:54:52,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:52,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:54:52,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:54:52,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446a8a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52, skipping insertion in model container [2025-03-14 00:54:52,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:54:52,454 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-3_1-container_of-global.i[186210,186223] [2025-03-14 00:54:52,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:52,491 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:54:52,548 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-3_1-container_of-global.i[186210,186223] [2025-03-14 00:54:52,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:54:52,606 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:54:52,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52 WrapperNode [2025-03-14 00:54:52,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:54:52,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:52,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:54:52,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:54:52,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,639 INFO L138 Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-03-14 00:54:52,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:54:52,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:54:52,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:54:52,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:54:52,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,669 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 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, 6, 2]. [2025-03-14 00:54:52,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:54:52,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:54:52,688 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:54:52,688 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:54:52,688 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (1/1) ... [2025-03-14 00:54:52,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:54:52,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:54:52,716 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-14 00:54:52,719 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-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-14 00:54:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:54:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-14 00:54:52,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-14 00:54:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-14 00:54:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:54:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:54:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:54:52,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:54:52,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:54:52,745 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:54:52,917 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:54:52,918 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:54:53,111 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:54:53,112 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:54:53,112 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:54:53,246 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:54:53,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:53 BoogieIcfgContainer [2025-03-14 00:54:53,247 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:54:53,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:54:53,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:54:53,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:54:53,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:54:52" (1/3) ... [2025-03-14 00:54:53,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b989c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:53, skipping insertion in model container [2025-03-14 00:54:53,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:54:52" (2/3) ... [2025-03-14 00:54:53,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b989c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:54:53, skipping insertion in model container [2025-03-14 00:54:53,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:53" (3/3) ... [2025-03-14 00:54:53,255 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2025-03-14 00:54:53,267 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:54:53,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_1-container_of-global.i that has 2 procedures, 46 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-14 00:54:53,269 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:54:53,313 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:54:53,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 134 flow [2025-03-14 00:54:53,371 INFO L124 PetriNetUnfolderBase]: 10/73 cut-off events. [2025-03-14 00:54:53,372 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:54:53,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 73 events. 10/73 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2025-03-14 00:54:53,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 60 transitions, 134 flow [2025-03-14 00:54:53,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 53 transitions, 118 flow [2025-03-14 00:54:53,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:54:53,392 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;@542a1222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:54:53,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 00:54:53,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:54:53,395 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-14 00:54:53,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:54:53,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:53,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-14 00:54:53,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:53,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:53,399 INFO L85 PathProgramCache]: Analyzing trace with hash 11437230, now seen corresponding path program 1 times [2025-03-14 00:54:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306144379] [2025-03-14 00:54:53,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:53,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-14 00:54:53,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-14 00:54:53,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:53,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:53,820 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-14 00:54:53,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:53,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306144379] [2025-03-14 00:54:53,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306144379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:53,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:53,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 00:54:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414423826] [2025-03-14 00:54:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:53,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:54:53,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:53,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:54:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:54:53,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:53,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 00:54:53,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:53,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:53,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:54,113 INFO L124 PetriNetUnfolderBase]: 466/826 cut-off events. [2025-03-14 00:54:54,113 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-14 00:54:54,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 826 events. 466/826 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3463 event pairs, 345 based on Foata normal form. 3/825 useless extension candidates. Maximal degree in co-relation 1541. Up to 602 conditions per place. [2025-03-14 00:54:54,123 INFO L140 encePairwiseOnDemand]: 45/60 looper letters, 39 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-14 00:54:54,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 218 flow [2025-03-14 00:54:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:54:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:54:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-03-14 00:54:54,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-14 00:54:54,138 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 118 flow. Second operand 3 states and 84 transitions. [2025-03-14 00:54:54,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 218 flow [2025-03-14 00:54:54,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:54,147 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 112 flow [2025-03-14 00:54:54,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-14 00:54:54,154 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2025-03-14 00:54:54,154 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 112 flow [2025-03-14 00:54:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-14 00:54:54,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:54,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-14 00:54:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:54:54,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1893666241, now seen corresponding path program 1 times [2025-03-14 00:54:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:54,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364281072] [2025-03-14 00:54:54,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:54,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:54,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-14 00:54:54,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-14 00:54:54,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:54,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:54,346 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-14 00:54:54,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364281072] [2025-03-14 00:54:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364281072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:54,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:54,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233001634] [2025-03-14 00:54:54,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:54,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:54,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:54,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:54,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:54,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:54,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 00:54:54,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:54,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:54,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:54,543 INFO L124 PetriNetUnfolderBase]: 466/821 cut-off events. [2025-03-14 00:54:54,543 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-14 00:54:54,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1712 conditions, 821 events. 466/821 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3455 event pairs, 155 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 818. Up to 553 conditions per place. [2025-03-14 00:54:54,550 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 47 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2025-03-14 00:54:54,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 265 flow [2025-03-14 00:54:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-14 00:54:54,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2025-03-14 00:54:54,554 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 112 flow. Second operand 5 states and 109 transitions. [2025-03-14 00:54:54,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 265 flow [2025-03-14 00:54:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:54,558 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 126 flow [2025-03-14 00:54:54,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-14 00:54:54,560 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2025-03-14 00:54:54,560 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 126 flow [2025-03-14 00:54:54,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-14 00:54:54,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:54,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:54,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 00:54:54,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2123878069, now seen corresponding path program 1 times [2025-03-14 00:54:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045182304] [2025-03-14 00:54:54,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:54,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:54,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-14 00:54:54,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:54:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:54,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:54,779 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-14 00:54:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045182304] [2025-03-14 00:54:54,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045182304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:54,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:54,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:54,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902951252] [2025-03-14 00:54:54,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:54,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:54,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:54,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:54,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:54,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:54,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-14 00:54:54,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:54,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:54,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:55,011 INFO L124 PetriNetUnfolderBase]: 562/1029 cut-off events. [2025-03-14 00:54:55,011 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-14 00:54:55,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2319 conditions, 1029 events. 562/1029 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4892 event pairs, 252 based on Foata normal form. 64/1092 useless extension candidates. Maximal degree in co-relation 228. Up to 545 conditions per place. [2025-03-14 00:54:55,017 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 49 selfloop transitions, 10 changer transitions 4/67 dead transitions. [2025-03-14 00:54:55,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 306 flow [2025-03-14 00:54:55,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:55,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-14 00:54:55,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-03-14 00:54:55,018 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 126 flow. Second operand 4 states and 102 transitions. [2025-03-14 00:54:55,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 306 flow [2025-03-14 00:54:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 286 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:55,020 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 150 flow [2025-03-14 00:54:55,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-14 00:54:55,021 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-14 00:54:55,021 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 150 flow [2025-03-14 00:54:55,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-14 00:54:55,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:55,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:54:55,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 00:54:55,022 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:55,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1145379758, now seen corresponding path program 1 times [2025-03-14 00:54:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582249897] [2025-03-14 00:54:55,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:55,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-14 00:54:55,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-14 00:54:55,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:55,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:55,122 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-14 00:54:55,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:55,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582249897] [2025-03-14 00:54:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582249897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 00:54:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754315503] [2025-03-14 00:54:55,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:55,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 00:54:55,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:55,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 00:54:55,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 00:54:55,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-14 00:54:55,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 00:54:55,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:55,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-14 00:54:55,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:55,255 INFO L124 PetriNetUnfolderBase]: 225/408 cut-off events. [2025-03-14 00:54:55,255 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-14 00:54:55,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 408 events. 225/408 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1439 event pairs, 46 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 927. Up to 217 conditions per place. [2025-03-14 00:54:55,258 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-14 00:54:55,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 278 flow [2025-03-14 00:54:55,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 00:54:55,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 00:54:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-14 00:54:55,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-14 00:54:55,259 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 150 flow. Second operand 4 states and 131 transitions. [2025-03-14 00:54:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 278 flow [2025-03-14 00:54:55,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 248 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-14 00:54:55,261 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 96 flow [2025-03-14 00:54:55,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2025-03-14 00:54:55,262 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -12 predicate places. [2025-03-14 00:54:55,262 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 96 flow [2025-03-14 00:54:55,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 00:54:55,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:55,262 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, 1, 1] [2025-03-14 00:54:55,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:54:55,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:55,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash 767607192, now seen corresponding path program 1 times [2025-03-14 00:54:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536417621] [2025-03-14 00:54:55,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:55,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:55,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:55,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:55,604 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-14 00:54:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536417621] [2025-03-14 00:54:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536417621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51307443] [2025-03-14 00:54:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:55,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:55,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:55,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:55,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:55,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:55,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:55,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:55,755 INFO L124 PetriNetUnfolderBase]: 251/458 cut-off events. [2025-03-14 00:54:55,755 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-03-14 00:54:55,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 458 events. 251/458 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1789 event pairs, 35 based on Foata normal form. 8/465 useless extension candidates. Maximal degree in co-relation 219. Up to 271 conditions per place. [2025-03-14 00:54:55,757 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 56 selfloop transitions, 6 changer transitions 0/69 dead transitions. [2025-03-14 00:54:55,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 332 flow [2025-03-14 00:54:55,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-03-14 00:54:55,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-14 00:54:55,758 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 96 flow. Second operand 5 states and 164 transitions. [2025-03-14 00:54:55,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 332 flow [2025-03-14 00:54:55,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:55,760 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 126 flow [2025-03-14 00:54:55,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-14 00:54:55,760 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2025-03-14 00:54:55,760 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 126 flow [2025-03-14 00:54:55,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:55,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:55,761 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, 1, 1] [2025-03-14 00:54:55,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:54:55,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:55,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:55,761 INFO L85 PathProgramCache]: Analyzing trace with hash 24889744, now seen corresponding path program 2 times [2025-03-14 00:54:55,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:55,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399532035] [2025-03-14 00:54:55,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:55,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:55,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:55,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:55,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:56,170 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-14 00:54:56,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:56,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399532035] [2025-03-14 00:54:56,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399532035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:56,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:56,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171963478] [2025-03-14 00:54:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:56,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:56,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:56,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:56,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:56,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:56,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:56,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:56,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:56,362 INFO L124 PetriNetUnfolderBase]: 281/516 cut-off events. [2025-03-14 00:54:56,362 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2025-03-14 00:54:56,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 516 events. 281/516 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2030 event pairs, 37 based on Foata normal form. 8/523 useless extension candidates. Maximal degree in co-relation 354. Up to 307 conditions per place. [2025-03-14 00:54:56,366 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 58 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2025-03-14 00:54:56,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 378 flow [2025-03-14 00:54:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:56,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 164 transitions. [2025-03-14 00:54:56,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2025-03-14 00:54:56,367 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 126 flow. Second operand 5 states and 164 transitions. [2025-03-14 00:54:56,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 378 flow [2025-03-14 00:54:56,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 00:54:56,369 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 172 flow [2025-03-14 00:54:56,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2025-03-14 00:54:56,371 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2025-03-14 00:54:56,372 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 172 flow [2025-03-14 00:54:56,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:56,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:56,372 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, 1, 1] [2025-03-14 00:54:56,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 00:54:56,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:56,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:56,373 INFO L85 PathProgramCache]: Analyzing trace with hash 951724394, now seen corresponding path program 3 times [2025-03-14 00:54:56,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464114678] [2025-03-14 00:54:56,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:54:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:56,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:56,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:56,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:54:56,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:56,743 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-14 00:54:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464114678] [2025-03-14 00:54:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464114678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:54:56,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393731269] [2025-03-14 00:54:56,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:56,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:54:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:54:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:54:56,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:56,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 172 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 00:54:56,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:56,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:56,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:57,028 INFO L124 PetriNetUnfolderBase]: 324/607 cut-off events. [2025-03-14 00:54:57,028 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-14 00:54:57,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 607 events. 324/607 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2443 event pairs, 38 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 696. Up to 171 conditions per place. [2025-03-14 00:54:57,033 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 82 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2025-03-14 00:54:57,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 682 flow [2025-03-14 00:54:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:54:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:54:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2025-03-14 00:54:57,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2791666666666667 [2025-03-14 00:54:57,036 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 172 flow. Second operand 12 states and 201 transitions. [2025-03-14 00:54:57,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 682 flow [2025-03-14 00:54:57,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 674 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 00:54:57,038 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 288 flow [2025-03-14 00:54:57,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2025-03-14 00:54:57,042 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2025-03-14 00:54:57,042 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 288 flow [2025-03-14 00:54:57,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 00:54:57,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:57,042 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, 1, 1] [2025-03-14 00:54:57,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 00:54:57,042 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:57,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:57,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1738171910, now seen corresponding path program 4 times [2025-03-14 00:54:57,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:57,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324161342] [2025-03-14 00:54:57,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:54:57,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:57,066 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-03-14 00:54:57,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:57,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:54:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:57,287 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-14 00:54:57,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324161342] [2025-03-14 00:54:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324161342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:57,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:54:57,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134071779] [2025-03-14 00:54:57,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:57,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:54:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:54:57,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:54:57,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:54:57,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:57,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:57,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:54:57,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:57,484 INFO L124 PetriNetUnfolderBase]: 437/848 cut-off events. [2025-03-14 00:54:57,484 INFO L125 PetriNetUnfolderBase]: For 1430/1430 co-relation queries the response was YES. [2025-03-14 00:54:57,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 848 events. 437/848 cut-off events. For 1430/1430 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4074 event pairs, 115 based on Foata normal form. 16/864 useless extension candidates. Maximal degree in co-relation 2881. Up to 515 conditions per place. [2025-03-14 00:54:57,489 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 87 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2025-03-14 00:54:57,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 750 flow [2025-03-14 00:54:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:54:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:54:57,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2025-03-14 00:54:57,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2025-03-14 00:54:57,490 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 288 flow. Second operand 5 states and 173 transitions. [2025-03-14 00:54:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 750 flow [2025-03-14 00:54:57,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 725 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-14 00:54:57,494 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 370 flow [2025-03-14 00:54:57,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=370, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-14 00:54:57,495 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2025-03-14 00:54:57,495 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 370 flow [2025-03-14 00:54:57,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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-14 00:54:57,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:57,495 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, 1, 1] [2025-03-14 00:54:57,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:54:57,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:57,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1955268214, now seen corresponding path program 5 times [2025-03-14 00:54:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:57,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850241940] [2025-03-14 00:54:57,496 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:54:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:57,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-03-14 00:54:57,518 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-14 00:54:57,518 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:57,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:57,760 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-14 00:54:57,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:57,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850241940] [2025-03-14 00:54:57,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850241940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:57,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:57,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 00:54:57,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853742869] [2025-03-14 00:54:57,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:57,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:54:57,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:57,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:54:57,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:54:57,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:57,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 370 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 00:54:57,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:57,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:57,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:58,091 INFO L124 PetriNetUnfolderBase]: 437/844 cut-off events. [2025-03-14 00:54:58,091 INFO L125 PetriNetUnfolderBase]: For 2275/2275 co-relation queries the response was YES. [2025-03-14 00:54:58,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3182 conditions, 844 events. 437/844 cut-off events. For 2275/2275 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3981 event pairs, 45 based on Foata normal form. 2/846 useless extension candidates. Maximal degree in co-relation 3139. Up to 246 conditions per place. [2025-03-14 00:54:58,098 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 93 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2025-03-14 00:54:58,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 1017 flow [2025-03-14 00:54:58,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:54:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:54:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions. [2025-03-14 00:54:58,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28055555555555556 [2025-03-14 00:54:58,099 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 370 flow. Second operand 12 states and 202 transitions. [2025-03-14 00:54:58,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 1017 flow [2025-03-14 00:54:58,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 121 transitions, 995 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-14 00:54:58,108 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 465 flow [2025-03-14 00:54:58,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=465, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-14 00:54:58,110 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2025-03-14 00:54:58,110 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 465 flow [2025-03-14 00:54:58,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 00:54:58,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:58,111 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, 1, 1, 1, 1] [2025-03-14 00:54:58,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 00:54:58,111 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash -789106627, now seen corresponding path program 1 times [2025-03-14 00:54:58,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:58,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142643588] [2025-03-14 00:54:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:54:58,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:58,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:54:58,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:54:58,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:54:58,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:58,675 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-14 00:54:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:58,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142643588] [2025-03-14 00:54:58,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142643588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:58,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 00:54:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317173228] [2025-03-14 00:54:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:58,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:54:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:58,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:54:58,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:54:58,704 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:58,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-14 00:54:58,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:58,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:58,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:54:59,132 INFO L124 PetriNetUnfolderBase]: 437/842 cut-off events. [2025-03-14 00:54:59,132 INFO L125 PetriNetUnfolderBase]: For 2799/2799 co-relation queries the response was YES. [2025-03-14 00:54:59,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 842 events. 437/842 cut-off events. For 2799/2799 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3921 event pairs, 82 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 2470. Up to 368 conditions per place. [2025-03-14 00:54:59,137 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 72 selfloop transitions, 32 changer transitions 27/132 dead transitions. [2025-03-14 00:54:59,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 132 transitions, 1200 flow [2025-03-14 00:54:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:54:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:54:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 232 transitions. [2025-03-14 00:54:59,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2761904761904762 [2025-03-14 00:54:59,140 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 465 flow. Second operand 14 states and 232 transitions. [2025-03-14 00:54:59,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 132 transitions, 1200 flow [2025-03-14 00:54:59,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 132 transitions, 1148 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-03-14 00:54:59,147 INFO L231 Difference]: Finished difference. Result has 88 places, 78 transitions, 685 flow [2025-03-14 00:54:59,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=685, PETRI_PLACES=88, PETRI_TRANSITIONS=78} [2025-03-14 00:54:59,148 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 35 predicate places. [2025-03-14 00:54:59,148 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 78 transitions, 685 flow [2025-03-14 00:54:59,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-14 00:54:59,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:54:59,149 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, 1, 1, 1, 1] [2025-03-14 00:54:59,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 00:54:59,149 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:54:59,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:54:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1566873167, now seen corresponding path program 2 times [2025-03-14 00:54:59,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:54:59,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559765922] [2025-03-14 00:54:59,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:54:59,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:54:59,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:54:59,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:54:59,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:54:59,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:54:59,752 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-14 00:54:59,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:54:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559765922] [2025-03-14 00:54:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559765922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:54:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:54:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 00:54:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778438025] [2025-03-14 00:54:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:54:59,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:54:59,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:54:59,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:54:59,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:54:59,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:54:59,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 78 transitions, 685 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-14 00:54:59,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:54:59,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:54:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:00,151 INFO L124 PetriNetUnfolderBase]: 377/746 cut-off events. [2025-03-14 00:55:00,151 INFO L125 PetriNetUnfolderBase]: For 2801/2801 co-relation queries the response was YES. [2025-03-14 00:55:00,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 746 events. 377/746 cut-off events. For 2801/2801 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3382 event pairs, 66 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 3094. Up to 410 conditions per place. [2025-03-14 00:55:00,155 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 68 selfloop transitions, 28 changer transitions 32/129 dead transitions. [2025-03-14 00:55:00,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 129 transitions, 1242 flow [2025-03-14 00:55:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-14 00:55:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-14 00:55:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2025-03-14 00:55:00,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2782051282051282 [2025-03-14 00:55:00,157 INFO L175 Difference]: Start difference. First operand has 88 places, 78 transitions, 685 flow. Second operand 13 states and 217 transitions. [2025-03-14 00:55:00,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 129 transitions, 1242 flow [2025-03-14 00:55:00,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 129 transitions, 1135 flow, removed 15 selfloop flow, removed 10 redundant places. [2025-03-14 00:55:00,166 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 637 flow [2025-03-14 00:55:00,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=637, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2025-03-14 00:55:00,167 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2025-03-14 00:55:00,167 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 637 flow [2025-03-14 00:55:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-14 00:55:00,167 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:00,167 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, 1, 1, 1, 1] [2025-03-14 00:55:00,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 00:55:00,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:00,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1176814957, now seen corresponding path program 3 times [2025-03-14 00:55:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940774089] [2025-03-14 00:55:00,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:55:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:00,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:00,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:00,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 00:55:00,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:00,644 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-14 00:55:00,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:00,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940774089] [2025-03-14 00:55:00,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940774089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:00,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:00,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-14 00:55:00,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922726292] [2025-03-14 00:55:00,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:00,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 00:55:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:00,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 00:55:00,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-14 00:55:00,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:00,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-14 00:55:00,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:00,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:00,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:01,052 INFO L124 PetriNetUnfolderBase]: 295/584 cut-off events. [2025-03-14 00:55:01,052 INFO L125 PetriNetUnfolderBase]: For 2040/2040 co-relation queries the response was YES. [2025-03-14 00:55:01,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 584 events. 295/584 cut-off events. For 2040/2040 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2415 event pairs, 58 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 2387. Up to 301 conditions per place. [2025-03-14 00:55:01,055 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 58 selfloop transitions, 26 changer transitions 27/112 dead transitions. [2025-03-14 00:55:01,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 112 transitions, 1053 flow [2025-03-14 00:55:01,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 228 transitions. [2025-03-14 00:55:01,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2714285714285714 [2025-03-14 00:55:01,058 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 637 flow. Second operand 14 states and 228 transitions. [2025-03-14 00:55:01,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 112 transitions, 1053 flow [2025-03-14 00:55:01,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 112 transitions, 994 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-14 00:55:01,063 INFO L231 Difference]: Finished difference. Result has 93 places, 67 transitions, 579 flow [2025-03-14 00:55:01,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=579, PETRI_PLACES=93, PETRI_TRANSITIONS=67} [2025-03-14 00:55:01,064 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2025-03-14 00:55:01,065 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 67 transitions, 579 flow [2025-03-14 00:55:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 10 states have internal predecessors, (130), 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-14 00:55:01,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:01,066 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, 1, 1, 1, 1] [2025-03-14 00:55:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 00:55:01,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 339144083, now seen corresponding path program 4 times [2025-03-14 00:55:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:01,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375533182] [2025-03-14 00:55:01,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 00:55:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:01,082 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:01,097 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:01,097 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-14 00:55:01,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:01,566 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-14 00:55:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375533182] [2025-03-14 00:55:01,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375533182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:01,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:01,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 00:55:01,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892540860] [2025-03-14 00:55:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:01,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 00:55:01,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:01,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 00:55:01,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-14 00:55:01,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:01,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 67 transitions, 579 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-14 00:55:01,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:01,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:01,975 INFO L124 PetriNetUnfolderBase]: 228/449 cut-off events. [2025-03-14 00:55:01,975 INFO L125 PetriNetUnfolderBase]: For 1694/1694 co-relation queries the response was YES. [2025-03-14 00:55:01,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 449 events. 228/449 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1677 event pairs, 34 based on Foata normal form. 1/450 useless extension candidates. Maximal degree in co-relation 1899. Up to 237 conditions per place. [2025-03-14 00:55:01,977 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 45 selfloop transitions, 16 changer transitions 36/98 dead transitions. [2025-03-14 00:55:01,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 98 transitions, 920 flow [2025-03-14 00:55:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-14 00:55:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-14 00:55:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2025-03-14 00:55:01,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2025-03-14 00:55:01,979 INFO L175 Difference]: Start difference. First operand has 93 places, 67 transitions, 579 flow. Second operand 14 states and 220 transitions. [2025-03-14 00:55:01,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 98 transitions, 920 flow [2025-03-14 00:55:01,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 804 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-03-14 00:55:01,985 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 371 flow [2025-03-14 00:55:01,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=371, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2025-03-14 00:55:01,986 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2025-03-14 00:55:01,986 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 371 flow [2025-03-14 00:55:01,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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-14 00:55:01,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:01,986 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, 1, 1, 1, 1] [2025-03-14 00:55:01,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 00:55:01,988 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:01,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:01,988 INFO L85 PathProgramCache]: Analyzing trace with hash 562723705, now seen corresponding path program 5 times [2025-03-14 00:55:01,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:01,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904183911] [2025-03-14 00:55:01,989 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 00:55:01,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:02,006 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:02,013 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 31 statements. [2025-03-14 00:55:02,013 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 00:55:02,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:02,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904183911] [2025-03-14 00:55:02,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904183911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:55:02,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:55:02,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 00:55:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586621412] [2025-03-14 00:55:02,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:55:02,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 00:55:02,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:02,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 00:55:02,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 00:55:02,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-14 00:55:02,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 53 transitions, 371 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-14 00:55:02,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:02,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-14 00:55:02,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:02,207 INFO L124 PetriNetUnfolderBase]: 97/204 cut-off events. [2025-03-14 00:55:02,207 INFO L125 PetriNetUnfolderBase]: For 769/769 co-relation queries the response was YES. [2025-03-14 00:55:02,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 204 events. 97/204 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 589 event pairs, 21 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 816. Up to 96 conditions per place. [2025-03-14 00:55:02,209 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 45 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2025-03-14 00:55:02,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 64 transitions, 533 flow [2025-03-14 00:55:02,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 00:55:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 00:55:02,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-03-14 00:55:02,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2025-03-14 00:55:02,210 INFO L175 Difference]: Start difference. First operand has 87 places, 53 transitions, 371 flow. Second operand 5 states and 154 transitions. [2025-03-14 00:55:02,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 64 transitions, 533 flow [2025-03-14 00:55:02,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 421 flow, removed 16 selfloop flow, removed 18 redundant places. [2025-03-14 00:55:02,212 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 311 flow [2025-03-14 00:55:02,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2025-03-14 00:55:02,213 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2025-03-14 00:55:02,213 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 311 flow [2025-03-14 00:55:02,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 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-14 00:55:02,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:02,213 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, 1, 1, 1, 1] [2025-03-14 00:55:02,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 00:55:02,213 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:02,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 88366521, now seen corresponding path program 6 times [2025-03-14 00:55:02,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:02,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779354604] [2025-03-14 00:55:02,214 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:55:02,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:02,228 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:02,235 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:02,235 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 00:55:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779354604] [2025-03-14 00:55:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779354604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345056640] [2025-03-14 00:55:02,680 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 00:55:02,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:02,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:02,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:02,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:55:02,790 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 2 equivalence classes. [2025-03-14 00:55:02,826 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:02,826 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-14 00:55:02,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:02,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 00:55:02,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:02,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:03,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:03,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:03,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:03,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345056640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:03,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:03,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2025-03-14 00:55:03,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275329192] [2025-03-14 00:55:03,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:03,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 00:55:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:03,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 00:55:03,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-03-14 00:55:03,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:03,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 311 flow. Second operand has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 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-14 00:55:03,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:03,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:03,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:04,170 INFO L124 PetriNetUnfolderBase]: 144/303 cut-off events. [2025-03-14 00:55:04,170 INFO L125 PetriNetUnfolderBase]: For 823/823 co-relation queries the response was YES. [2025-03-14 00:55:04,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 303 events. 144/303 cut-off events. For 823/823 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 995 event pairs, 18 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 736. Up to 103 conditions per place. [2025-03-14 00:55:04,172 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 36 selfloop transitions, 15 changer transitions 41/93 dead transitions. [2025-03-14 00:55:04,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 93 transitions, 680 flow [2025-03-14 00:55:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-14 00:55:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-14 00:55:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 264 transitions. [2025-03-14 00:55:04,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24444444444444444 [2025-03-14 00:55:04,175 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 311 flow. Second operand 18 states and 264 transitions. [2025-03-14 00:55:04,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 93 transitions, 680 flow [2025-03-14 00:55:04,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 632 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-14 00:55:04,179 INFO L231 Difference]: Finished difference. Result has 80 places, 42 transitions, 237 flow [2025-03-14 00:55:04,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=237, PETRI_PLACES=80, PETRI_TRANSITIONS=42} [2025-03-14 00:55:04,180 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-03-14 00:55:04,180 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 42 transitions, 237 flow [2025-03-14 00:55:04,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 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-14 00:55:04,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:55:04,180 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, 1, 1, 1, 1] [2025-03-14 00:55:04,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:55:04,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 00:55:04,381 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-14 00:55:04,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:55:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1304344215, now seen corresponding path program 7 times [2025-03-14 00:55:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:55:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577275582] [2025-03-14 00:55:04,382 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:55:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:55:04,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:04,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:04,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:04,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:55:04,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577275582] [2025-03-14 00:55:04,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577275582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:55:04,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931684725] [2025-03-14 00:55:04,895 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 00:55:04,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:55:04,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:55:04,897 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:55:04,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:55:05,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 00:55:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 00:55:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:55:05,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:55:05,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-14 00:55:05,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:55:05,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-03-14 00:55:05,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:05,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 00:55:05,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2025-03-14 00:55:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:05,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:55:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:55:05,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931684725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:55:05,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:55:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2025-03-14 00:55:05,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36124149] [2025-03-14 00:55:05,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:55:05,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-14 00:55:05,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:55:05,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-14 00:55:05,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-03-14 00:55:05,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 60 [2025-03-14 00:55:05,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 42 transitions, 237 flow. Second operand has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 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-14 00:55:05,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:55:05,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 60 [2025-03-14 00:55:05,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:55:06,149 INFO L124 PetriNetUnfolderBase]: 74/159 cut-off events. [2025-03-14 00:55:06,149 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2025-03-14 00:55:06,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 159 events. 74/159 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 366 event pairs, 0 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 543. Up to 61 conditions per place. [2025-03-14 00:55:06,150 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 0 selfloop transitions, 0 changer transitions 51/51 dead transitions. [2025-03-14 00:55:06,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 51 transitions, 361 flow [2025-03-14 00:55:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:55:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:55:06,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2025-03-14 00:55:06,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23333333333333334 [2025-03-14 00:55:06,152 INFO L175 Difference]: Start difference. First operand has 80 places, 42 transitions, 237 flow. Second operand 12 states and 168 transitions. [2025-03-14 00:55:06,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 51 transitions, 361 flow [2025-03-14 00:55:06,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 51 transitions, 303 flow, removed 8 selfloop flow, removed 16 redundant places. [2025-03-14 00:55:06,153 INFO L231 Difference]: Finished difference. Result has 63 places, 0 transitions, 0 flow [2025-03-14 00:55:06,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=63, PETRI_TRANSITIONS=0} [2025-03-14 00:55:06,155 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 10 predicate places. [2025-03-14 00:55:06,155 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 0 transitions, 0 flow [2025-03-14 00:55:06,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.346153846153847) internal successors, (347), 26 states have internal predecessors, (347), 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-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-03-14 00:55:06,158 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-03-14 00:55:06,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 00:55:06,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-14 00:55:06,359 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1, 1, 1] [2025-03-14 00:55:06,362 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 00:55:06,362 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 00:55:06,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 12:55:06 BasicIcfg [2025-03-14 00:55:06,365 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 00:55:06,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 00:55:06,366 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 00:55:06,366 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 00:55:06,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:54:53" (3/4) ... [2025-03-14 00:55:06,367 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 00:55:06,370 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure my_callback [2025-03-14 00:55:06,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 101 nodes and edges [2025-03-14 00:55:06,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-14 00:55:06,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-14 00:55:06,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 00:55:06,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 00:55:06,445 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 00:55:06,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 00:55:06,446 INFO L158 Benchmark]: Toolchain (without parser) took 14331.18ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 102.7MB in the beginning and 192.3MB in the end (delta: -89.6MB). Peak memory consumption was 304.1MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,446 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:06,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.78ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 71.9MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.78ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 69.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:06,447 INFO L158 Benchmark]: Boogie Preprocessor took 46.75ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,447 INFO L158 Benchmark]: IcfgBuilder took 559.22ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 90.7MB in the end (delta: -24.6MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,447 INFO L158 Benchmark]: TraceAbstraction took 13116.49ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 90.7MB in the beginning and 200.6MB in the end (delta: -110.0MB). Peak memory consumption was 288.1MB. Max. memory is 16.1GB. [2025-03-14 00:55:06,448 INFO L158 Benchmark]: Witness Printer took 79.22ms. Allocated memory is still 536.9MB. Free memory was 200.6MB in the beginning and 192.3MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 00:55:06,449 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 124.1MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.78ms. Allocated memory is still 142.6MB. Free memory was 102.7MB in the beginning and 71.9MB in the end (delta: 30.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.78ms. Allocated memory is still 142.6MB. Free memory was 71.9MB in the beginning and 69.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.75ms. Allocated memory is still 142.6MB. Free memory was 69.3MB in the beginning and 66.0MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 559.22ms. Allocated memory is still 142.6MB. Free memory was 66.0MB in the beginning and 90.7MB in the end (delta: -24.6MB). Peak memory consumption was 41.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13116.49ms. Allocated memory was 142.6MB in the beginning and 536.9MB in the end (delta: 394.3MB). Free memory was 90.7MB in the beginning and 200.6MB in the end (delta: -110.0MB). Peak memory consumption was 288.1MB. Max. memory is 16.1GB. * Witness Printer took 79.22ms. Allocated memory is still 536.9MB. Free memory was 200.6MB in the beginning and 192.3MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 3885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 60 locations, 8 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: 13.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 791 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4048 IncrementalHoareTripleChecker+Invalid, 4218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 40 mSDtfsCounter, 4048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=685occurred in iteration=10, InterpolantAutomatonStates: 145, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 469 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 6633 SizeOfPredicates, 36 NumberOfNonLiveVariables, 632 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 00:55:06,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE