./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c -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 89709bb47b610a4df8ebebb98f986617107087e38eda51e5a7e5dd21ddd22ba8 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:52:14,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:52:14,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:52:14,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:52:14,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:52:14,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:52:14,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:52:14,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:52:14,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:52:14,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:52:14,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:52:14,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:52:14,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:52:14,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:14,420 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:52:14,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:14,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:52:14,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:52:14,421 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 -> 89709bb47b610a4df8ebebb98f986617107087e38eda51e5a7e5dd21ddd22ba8 [2025-04-29 10:52:14,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:52:14,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:52:14,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:52:14,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:52:14,646 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:52:14,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c [2025-04-29 10:52:15,941 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee6341e/e11a71119d1b488e86980ee3397e1ff0/FLAGb13b9e80b [2025-04-29 10:52:16,133 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:52:16,134 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c [2025-04-29 10:52:16,135 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:16,135 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:52:16,140 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee6341e/e11a71119d1b488e86980ee3397e1ff0/FLAGb13b9e80b [2025-04-29 10:52:16,942 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ee6341e/e11a71119d1b488e86980ee3397e1ff0 [2025-04-29 10:52:16,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:52:16,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:52:16,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:16,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:52:16,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:52:16,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:16" (1/1) ... [2025-04-29 10:52:16,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316aad93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:16, skipping insertion in model container [2025-04-29 10:52:16,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:52:16" (1/1) ... [2025-04-29 10:52:16,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:52:17,103 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c[399,412] [2025-04-29 10:52:17,126 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:17,132 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:52:17,154 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.c[399,412] [2025-04-29 10:52:17,164 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:52:17,177 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:52:17,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17 WrapperNode [2025-04-29 10:52:17,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:52:17,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:17,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:52:17,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:52:17,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,210 INFO L138 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2025-04-29 10:52:17,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:52:17,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:52:17,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:52:17,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:52:17,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,237 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 0 writes are split as follows [0, 0]. [2025-04-29 10:52:17,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:52:17,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:52:17,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:52:17,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:52:17,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (1/1) ... [2025-04-29 10:52:17,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:52:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:52:17,276 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-04-29 10:52:17,277 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-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-29 10:52:17,293 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 10:52:17,293 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-04-29 10:52:17,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-04-29 10:52:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 10:52:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:52:17,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:52:17,294 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 10:52:17,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 10:52:17,295 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 10:52:17,363 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:52:17,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:52:17,577 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 10:52:17,577 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:52:17,698 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:52:17,698 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 10:52:17,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:17 BoogieIcfgContainer [2025-04-29 10:52:17,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:52:17,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:52:17,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:52:17,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:52:17,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:52:16" (1/3) ... [2025-04-29 10:52:17,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7df570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:17, skipping insertion in model container [2025-04-29 10:52:17,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:52:17" (2/3) ... [2025-04-29 10:52:17,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7df570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:52:17, skipping insertion in model container [2025-04-29 10:52:17,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:17" (3/3) ... [2025-04-29 10:52:17,707 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.c [2025-04-29 10:52:17,715 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:52:17,716 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.c that has 4 procedures, 64 locations, 65 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 10:52:17,717 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 10:52:17,779 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 10:52:17,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 148 flow [2025-04-29 10:52:17,838 INFO L116 PetriNetUnfolderBase]: 5/65 cut-off events. [2025-04-29 10:52:17,840 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:17,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 65 events. 5/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 154 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-04-29 10:52:17,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 68 transitions, 148 flow [2025-04-29 10:52:17,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 65 transitions, 139 flow [2025-04-29 10:52:17,856 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:52:17,866 INFO L340 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;@640daf05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:52:17,866 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 10:52:17,875 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 10:52:17,877 INFO L116 PetriNetUnfolderBase]: 1/35 cut-off events. [2025-04-29 10:52:17,877 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 10:52:17,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:17,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:17,878 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:17,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1872145645, now seen corresponding path program 1 times [2025-04-29 10:52:17,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:17,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763736662] [2025-04-29 10:52:17,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:17,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 10:52:17,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 10:52:17,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:17,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:18,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763736662] [2025-04-29 10:52:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763736662] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:18,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:18,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:18,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338422084] [2025-04-29 10:52:18,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:18,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:18,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:18,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:18,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-04-29 10:52:18,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:18,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:18,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-04-29 10:52:18,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:21,312 INFO L116 PetriNetUnfolderBase]: 30713/46909 cut-off events. [2025-04-29 10:52:21,312 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-29 10:52:21,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90038 conditions, 46909 events. 30713/46909 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 349898 event pairs, 7163 based on Foata normal form. 3860/49772 useless extension candidates. Maximal degree in co-relation 90027. Up to 11332 conditions per place. [2025-04-29 10:52:21,510 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 190 selfloop transitions, 11 changer transitions 0/220 dead transitions. [2025-04-29 10:52:21,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 220 transitions, 872 flow [2025-04-29 10:52:21,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:21,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 401 transitions. [2025-04-29 10:52:21,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7371323529411765 [2025-04-29 10:52:21,520 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 139 flow. Second operand 8 states and 401 transitions. [2025-04-29 10:52:21,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 220 transitions, 872 flow [2025-04-29 10:52:21,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 220 transitions, 862 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 10:52:21,532 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 189 flow [2025-04-29 10:52:21,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=189, PETRI_PLACES=78, PETRI_TRANSITIONS=69} [2025-04-29 10:52:21,536 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-04-29 10:52:21,536 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 189 flow [2025-04-29 10:52:21,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:21,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:21,537 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:21,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:52:21,537 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:21,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1165101252, now seen corresponding path program 1 times [2025-04-29 10:52:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:21,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461338346] [2025-04-29 10:52:21,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:21,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 10:52:21,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 10:52:21,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:21,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:21,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:21,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461338346] [2025-04-29 10:52:21,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461338346] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:21,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:21,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:21,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950546668] [2025-04-29 10:52:21,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:21,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:21,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:21,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:21,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:21,728 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-04-29 10:52:21,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 69 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:21,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:21,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-04-29 10:52:21,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:25,175 INFO L116 PetriNetUnfolderBase]: 46522/71691 cut-off events. [2025-04-29 10:52:25,176 INFO L117 PetriNetUnfolderBase]: For 13700/13700 co-relation queries the response was YES. [2025-04-29 10:52:25,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153112 conditions, 71691 events. 46522/71691 cut-off events. For 13700/13700 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 570360 event pairs, 9900 based on Foata normal form. 0/70298 useless extension candidates. Maximal degree in co-relation 153098. Up to 27642 conditions per place. [2025-04-29 10:52:25,530 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 193 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2025-04-29 10:52:25,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 228 transitions, 1054 flow [2025-04-29 10:52:25,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-04-29 10:52:25,532 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6360294117647058 [2025-04-29 10:52:25,532 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 189 flow. Second operand 8 states and 346 transitions. [2025-04-29 10:52:25,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 228 transitions, 1054 flow [2025-04-29 10:52:26,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 228 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:26,020 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 288 flow [2025-04-29 10:52:26,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=89, PETRI_TRANSITIONS=82} [2025-04-29 10:52:26,021 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-04-29 10:52:26,021 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 288 flow [2025-04-29 10:52:26,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:26,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:26,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:26,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:52:26,022 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:26,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1362309983, now seen corresponding path program 1 times [2025-04-29 10:52:26,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:26,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009741894] [2025-04-29 10:52:26,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:26,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 10:52:26,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 10:52:26,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:26,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:26,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:26,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009741894] [2025-04-29 10:52:26,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009741894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:26,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311576300] [2025-04-29 10:52:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:26,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:26,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:26,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:26,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:26,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-04-29 10:52:26,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 82 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-04-29 10:52:26,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:26,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-04-29 10:52:26,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:31,733 INFO L116 PetriNetUnfolderBase]: 60127/97560 cut-off events. [2025-04-29 10:52:31,733 INFO L117 PetriNetUnfolderBase]: For 39044/39499 co-relation queries the response was YES. [2025-04-29 10:52:32,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225789 conditions, 97560 events. 60127/97560 cut-off events. For 39044/39499 co-relation queries the response was YES. Maximal size of possible extension queue 2965. Compared 869106 event pairs, 20848 based on Foata normal form. 0/96229 useless extension candidates. Maximal degree in co-relation 225769. Up to 41717 conditions per place. [2025-04-29 10:52:32,319 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 215 selfloop transitions, 17 changer transitions 3/257 dead transitions. [2025-04-29 10:52:32,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 257 transitions, 1362 flow [2025-04-29 10:52:32,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:32,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:32,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 363 transitions. [2025-04-29 10:52:32,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6672794117647058 [2025-04-29 10:52:32,321 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 288 flow. Second operand 8 states and 363 transitions. [2025-04-29 10:52:32,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 257 transitions, 1362 flow [2025-04-29 10:52:34,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 257 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:34,234 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 397 flow [2025-04-29 10:52:34,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-04-29 10:52:34,235 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 30 predicate places. [2025-04-29 10:52:34,235 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 397 flow [2025-04-29 10:52:34,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-04-29 10:52:34,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:34,235 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:34,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:52:34,236 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:34,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2016799986, now seen corresponding path program 1 times [2025-04-29 10:52:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:34,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091643712] [2025-04-29 10:52:34,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:34,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 10:52:34,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 10:52:34,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:34,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:34,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:34,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091643712] [2025-04-29 10:52:34,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091643712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:34,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:34,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:52:34,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242013967] [2025-04-29 10:52:34,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:34,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:52:34,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:34,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:52:34,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:52:34,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-04-29 10:52:34,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-04-29 10:52:34,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:34,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-04-29 10:52:34,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:38,347 INFO L116 PetriNetUnfolderBase]: 38911/66960 cut-off events. [2025-04-29 10:52:38,348 INFO L117 PetriNetUnfolderBase]: For 42506/43708 co-relation queries the response was YES. [2025-04-29 10:52:38,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169770 conditions, 66960 events. 38911/66960 cut-off events. For 42506/43708 co-relation queries the response was YES. Maximal size of possible extension queue 2458. Compared 632669 event pairs, 13965 based on Foata normal form. 3031/69784 useless extension candidates. Maximal degree in co-relation 169744. Up to 34535 conditions per place. [2025-04-29 10:52:38,833 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 118 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2025-04-29 10:52:38,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 156 transitions, 942 flow [2025-04-29 10:52:38,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:52:38,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 10:52:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-04-29 10:52:38,834 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-04-29 10:52:38,834 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 397 flow. Second operand 3 states and 150 transitions. [2025-04-29 10:52:38,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 156 transitions, 942 flow [2025-04-29 10:52:40,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 10:52:40,413 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 468 flow [2025-04-29 10:52:40,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2025-04-29 10:52:40,413 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 33 predicate places. [2025-04-29 10:52:40,413 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 468 flow [2025-04-29 10:52:40,414 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-04-29 10:52:40,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:40,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:40,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 10:52:40,414 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:40,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 674069468, now seen corresponding path program 1 times [2025-04-29 10:52:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:40,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333929177] [2025-04-29 10:52:40,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:40,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 10:52:40,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:52:40,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:40,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:40,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333929177] [2025-04-29 10:52:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333929177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:52:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986492199] [2025-04-29 10:52:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:40,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:52:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:40,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:52:40,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:52:40,585 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-04-29 10:52:40,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 468 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-04-29 10:52:40,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:40,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-04-29 10:52:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:43,135 INFO L116 PetriNetUnfolderBase]: 20387/36599 cut-off events. [2025-04-29 10:52:43,136 INFO L117 PetriNetUnfolderBase]: For 31331/32318 co-relation queries the response was YES. [2025-04-29 10:52:43,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102991 conditions, 36599 events. 20387/36599 cut-off events. For 31331/32318 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 326959 event pairs, 5653 based on Foata normal form. 1395/37906 useless extension candidates. Maximal degree in co-relation 102963. Up to 18926 conditions per place. [2025-04-29 10:52:43,363 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 104 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2025-04-29 10:52:43,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 853 flow [2025-04-29 10:52:43,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-04-29 10:52:43,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-04-29 10:52:43,364 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 468 flow. Second operand 4 states and 160 transitions. [2025-04-29 10:52:43,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 853 flow [2025-04-29 10:52:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:43,848 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 475 flow [2025-04-29 10:52:43,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2025-04-29 10:52:43,850 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 35 predicate places. [2025-04-29 10:52:43,850 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 475 flow [2025-04-29 10:52:43,850 INFO L486 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-04-29 10:52:43,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:43,850 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] [2025-04-29 10:52:43,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 10:52:43,851 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:43,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -789507147, now seen corresponding path program 1 times [2025-04-29 10:52:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:43,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575976619] [2025-04-29 10:52:43,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:43,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:52:43,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:52:43,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:43,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:43,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575976619] [2025-04-29 10:52:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575976619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:43,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:43,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:43,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248457743] [2025-04-29 10:52:43,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:43,947 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:43,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:43,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:43,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:43,956 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-04-29 10:52:43,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 475 flow. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-04-29 10:52:43,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:43,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-04-29 10:52:43,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:46,556 INFO L116 PetriNetUnfolderBase]: 24250/40163 cut-off events. [2025-04-29 10:52:46,556 INFO L117 PetriNetUnfolderBase]: For 36498/37403 co-relation queries the response was YES. [2025-04-29 10:52:46,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116803 conditions, 40163 events. 24250/40163 cut-off events. For 36498/37403 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 331549 event pairs, 4853 based on Foata normal form. 545/40638 useless extension candidates. Maximal degree in co-relation 116774. Up to 11342 conditions per place. [2025-04-29 10:52:46,789 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 202 selfloop transitions, 27 changer transitions 27/277 dead transitions. [2025-04-29 10:52:46,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 277 transitions, 1812 flow [2025-04-29 10:52:46,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:52:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 10:52:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2025-04-29 10:52:46,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2025-04-29 10:52:46,791 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 475 flow. Second operand 8 states and 350 transitions. [2025-04-29 10:52:46,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 277 transitions, 1812 flow [2025-04-29 10:52:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 277 transitions, 1758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 10:52:47,298 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 568 flow [2025-04-29 10:52:47,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=568, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-04-29 10:52:47,299 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2025-04-29 10:52:47,299 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 568 flow [2025-04-29 10:52:47,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 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-04-29 10:52:47,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:47,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:47,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:52:47,299 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:47,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1072565247, now seen corresponding path program 1 times [2025-04-29 10:52:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:47,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949785984] [2025-04-29 10:52:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-29 10:52:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-29 10:52:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:47,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:47,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:47,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949785984] [2025-04-29 10:52:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949785984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:47,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:47,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:47,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111083651] [2025-04-29 10:52:47,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:47,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:47,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:47,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:47,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:47,394 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-04-29 10:52:47,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 568 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-04-29 10:52:47,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:47,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-04-29 10:52:47,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:50,230 INFO L116 PetriNetUnfolderBase]: 22611/36777 cut-off events. [2025-04-29 10:52:50,230 INFO L117 PetriNetUnfolderBase]: For 36050/36115 co-relation queries the response was YES. [2025-04-29 10:52:50,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108630 conditions, 36777 events. 22611/36777 cut-off events. For 36050/36115 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 290458 event pairs, 4720 based on Foata normal form. 650/37396 useless extension candidates. Maximal degree in co-relation 108602. Up to 7735 conditions per place. [2025-04-29 10:52:50,425 INFO L140 encePairwiseOnDemand]: 56/68 looper letters, 204 selfloop transitions, 41 changer transitions 33/295 dead transitions. [2025-04-29 10:52:50,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 295 transitions, 1911 flow [2025-04-29 10:52:50,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 10:52:50,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 10:52:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2025-04-29 10:52:50,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5477941176470589 [2025-04-29 10:52:50,427 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 568 flow. Second operand 12 states and 447 transitions. [2025-04-29 10:52:50,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 295 transitions, 1911 flow [2025-04-29 10:52:50,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 295 transitions, 1908 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 10:52:50,679 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 742 flow [2025-04-29 10:52:50,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=742, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2025-04-29 10:52:50,682 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 49 predicate places. [2025-04-29 10:52:50,682 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 742 flow [2025-04-29 10:52:50,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 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-04-29 10:52:50,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:50,683 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] [2025-04-29 10:52:50,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 10:52:50,683 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:50,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1252592868, now seen corresponding path program 1 times [2025-04-29 10:52:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:50,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82733402] [2025-04-29 10:52:50,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:50,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 10:52:50,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 10:52:50,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:50,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:50,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82733402] [2025-04-29 10:52:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82733402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 10:52:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577062830] [2025-04-29 10:52:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:50,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:52:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:50,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:52:50,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:52:50,807 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-04-29 10:52:50,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 742 flow. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-04-29 10:52:50,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:50,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-04-29 10:52:50,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:53,438 INFO L116 PetriNetUnfolderBase]: 21659/35745 cut-off events. [2025-04-29 10:52:53,438 INFO L117 PetriNetUnfolderBase]: For 54917/55404 co-relation queries the response was YES. [2025-04-29 10:52:53,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113975 conditions, 35745 events. 21659/35745 cut-off events. For 54917/55404 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 283498 event pairs, 5623 based on Foata normal form. 422/36127 useless extension candidates. Maximal degree in co-relation 113943. Up to 7264 conditions per place. [2025-04-29 10:52:53,638 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 107 selfloop transitions, 20 changer transitions 150/293 dead transitions. [2025-04-29 10:52:53,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 293 transitions, 2117 flow [2025-04-29 10:52:53,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 10:52:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 10:52:53,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 438 transitions. [2025-04-29 10:52:53,639 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5855614973262032 [2025-04-29 10:52:53,639 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 742 flow. Second operand 11 states and 438 transitions. [2025-04-29 10:52:53,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 293 transitions, 2117 flow [2025-04-29 10:52:54,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 293 transitions, 2052 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-29 10:52:54,068 INFO L231 Difference]: Finished difference. Result has 121 places, 82 transitions, 457 flow [2025-04-29 10:52:54,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=457, PETRI_PLACES=121, PETRI_TRANSITIONS=82} [2025-04-29 10:52:54,068 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 51 predicate places. [2025-04-29 10:52:54,069 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 82 transitions, 457 flow [2025-04-29 10:52:54,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 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-04-29 10:52:54,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 10:52:54,069 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, 1, 1, 1] [2025-04-29 10:52:54,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 10:52:54,069 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-04-29 10:52:54,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:52:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1607943607, now seen corresponding path program 1 times [2025-04-29 10:52:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:52:54,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494210540] [2025-04-29 10:52:54,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:52:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:52:54,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 10:52:54,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 10:52:54,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:52:54,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:52:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:52:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:52:54,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494210540] [2025-04-29 10:52:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494210540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:52:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:52:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:52:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57200778] [2025-04-29 10:52:54,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:52:54,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:52:54,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:52:54,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:52:54,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:52:54,262 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-04-29 10:52:54,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 82 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:54,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 10:52:54,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-04-29 10:52:54,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 10:52:54,473 INFO L116 PetriNetUnfolderBase]: 1444/2506 cut-off events. [2025-04-29 10:52:54,473 INFO L117 PetriNetUnfolderBase]: For 2629/2695 co-relation queries the response was YES. [2025-04-29 10:52:54,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7258 conditions, 2506 events. 1444/2506 cut-off events. For 2629/2695 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 13571 event pairs, 509 based on Foata normal form. 114/2612 useless extension candidates. Maximal degree in co-relation 7243. Up to 1376 conditions per place. [2025-04-29 10:52:54,480 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 0 selfloop transitions, 0 changer transitions 82/82 dead transitions. [2025-04-29 10:52:54,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 82 transitions, 553 flow [2025-04-29 10:52:54,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:52:54,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 10:52:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-04-29 10:52:54,481 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2025-04-29 10:52:54,481 INFO L175 Difference]: Start difference. First operand has 121 places, 82 transitions, 457 flow. Second operand 4 states and 148 transitions. [2025-04-29 10:52:54,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 82 transitions, 553 flow [2025-04-29 10:52:54,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 476 flow, removed 2 selfloop flow, removed 19 redundant places. [2025-04-29 10:52:54,488 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2025-04-29 10:52:54,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=76, PETRI_TRANSITIONS=0} [2025-04-29 10:52:54,489 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2025-04-29 10:52:54,489 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2025-04-29 10:52:54,489 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-29 10:52:54,491 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-04-29 10:52:54,492 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-04-29 10:52:54,492 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-04-29 10:52:54,492 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-04-29 10:52:54,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 10:52:54,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:52:54,495 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 10:52:54,495 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 10:52:54,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 10:52:54 BasicIcfg [2025-04-29 10:52:54,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 10:52:54,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 10:52:54,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 10:52:54,501 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 10:52:54,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:52:17" (3/4) ... [2025-04-29 10:52:54,503 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 10:52:54,505 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-04-29 10:52:54,505 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2025-04-29 10:52:54,505 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 10:52:54,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2025-04-29 10:52:54,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 10:52:54,507 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 10:52:54,556 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 10:52:54,557 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 10:52:54,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 10:52:54,557 INFO L158 Benchmark]: Toolchain (without parser) took 37612.29ms. Allocated memory was 142.6MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 112.4MB in the beginning and 8.2GB in the end (delta: -8.1GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-04-29 10:52:54,558 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:54,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.24ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 10:52:54,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:54,558 INFO L158 Benchmark]: Boogie Preprocessor took 40.46ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:54,558 INFO L158 Benchmark]: RCFGBuilder took 446.90ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 63.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-29 10:52:54,559 INFO L158 Benchmark]: TraceAbstraction took 36800.16ms. Allocated memory was 142.6MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 62.5MB in the beginning and 8.2GB in the end (delta: -8.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-04-29 10:52:54,559 INFO L158 Benchmark]: Witness Printer took 56.07ms. Allocated memory is still 11.1GB. Free memory was 8.2GB in the beginning and 8.2GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 10:52:54,560 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.21ms. Allocated memory is still 167.8MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.24ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 97.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.46ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 446.90ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 63.2MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 36800.16ms. Allocated memory was 142.6MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 62.5MB in the beginning and 8.2GB in the end (delta: -8.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 56.07ms. Allocated memory is still 11.1GB. Free memory was 8.2GB in the beginning and 8.2GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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: 11]: 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: 11]: 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: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 107 locations, 111 edges, 9 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: 36.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1030 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1009 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2743 IncrementalHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 4 mSDtfsCounter, 2743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=742occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 10:52:54,573 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