./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:40:20,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:40:20,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:40:20,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:40:20,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:40:20,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:40:20,677 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:40:20,677 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:40:20,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:40:20,677 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:40:20,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:40:20,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:40:20,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:40:20,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:40:20,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:40:20,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:20,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:40:20,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:40:20,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:40:20,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:40:20,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:40:20,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:40:20,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:40:20,681 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 -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2025-03-13 21:40:20,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:40:20,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:40:20,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:40:20,958 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:40:20,959 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:40:20,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-03-13 21:40:22,120 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce43aa475/ba6e35951d604fc788636d29f8812653/FLAG0a20fe86c [2025-03-13 21:40:22,403 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:40:22,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-03-13 21:40:22,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce43aa475/ba6e35951d604fc788636d29f8812653/FLAG0a20fe86c [2025-03-13 21:40:22,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce43aa475/ba6e35951d604fc788636d29f8812653 [2025-03-13 21:40:22,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:40:22,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:40:22,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:22,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:40:22,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:40:22,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aa76f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22, skipping insertion in model container [2025-03-13 21:40:22,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:40:22,598 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-03-13 21:40:22,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:22,728 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:40:22,735 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-03-13 21:40:22,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:22,802 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:40:22,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22 WrapperNode [2025-03-13 21:40:22,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:22,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:22,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:40:22,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:40:22,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,839 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-03-13 21:40:22,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:22,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:40:22,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:40:22,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:40:22,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,877 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2025-03-13 21:40:22,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:40:22,894 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:40:22,894 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:40:22,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:40:22,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (1/1) ... [2025-03-13 21:40:22,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:22,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:22,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:40:22,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:40:22,948 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-13 21:40:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-13 21:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-03-13 21:40:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-03-13 21:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 21:40:22,949 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 21:40:22,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-13 21:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:40:22,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:40:22,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:40:22,951 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:40:23,055 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:40:23,057 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:40:23,283 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:40:23,287 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:40:23,287 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:40:23,470 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:40:23,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:23 BoogieIcfgContainer [2025-03-13 21:40:23,471 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:40:23,473 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:40:23,473 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:40:23,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:40:23,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:40:22" (1/3) ... [2025-03-13 21:40:23,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:23, skipping insertion in model container [2025-03-13 21:40:23,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:22" (2/3) ... [2025-03-13 21:40:23,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:23, skipping insertion in model container [2025-03-13 21:40:23,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:23" (3/3) ... [2025-03-13 21:40:23,480 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-03-13 21:40:23,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:40:23,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_21-traces-cluster-based_true.i that has 4 procedures, 64 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-13 21:40:23,491 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:40:23,541 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 21:40:23,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 148 flow [2025-03-13 21:40:23,602 INFO L124 PetriNetUnfolderBase]: 5/65 cut-off events. [2025-03-13 21:40:23,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:40:23,607 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 5. Compared 155 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-03-13 21:40:23,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 68 transitions, 148 flow [2025-03-13 21:40:23,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 65 transitions, 139 flow [2025-03-13 21:40:23,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:40:23,629 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@333e6763, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:40:23,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-13 21:40:23,643 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:40:23,643 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-03-13 21:40:23,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:40:23,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:23,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:23,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:23,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash -749575732, now seen corresponding path program 1 times [2025-03-13 21:40:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:23,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835776744] [2025-03-13 21:40:23,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:23,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:23,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-13 21:40:23,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-13 21:40:23,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:23,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:23,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:23,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835776744] [2025-03-13 21:40:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835776744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:23,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:23,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350551394] [2025-03-13 21:40:23,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:23,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:24,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:24,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:24,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-03-13 21:40:24,012 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-03-13 21:40:24,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:24,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-03-13 21:40:24,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:27,041 INFO L124 PetriNetUnfolderBase]: 30713/46909 cut-off events. [2025-03-13 21:40:27,041 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-13 21:40:27,113 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 349968 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-03-13 21:40:27,284 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 190 selfloop transitions, 11 changer transitions 0/220 dead transitions. [2025-03-13 21:40:27,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 220 transitions, 872 flow [2025-03-13 21:40:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:40:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:40:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 401 transitions. [2025-03-13 21:40:27,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7371323529411765 [2025-03-13 21:40:27,298 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 139 flow. Second operand 8 states and 401 transitions. [2025-03-13 21:40:27,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 220 transitions, 872 flow [2025-03-13 21:40:27,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 220 transitions, 862 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:40:27,311 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 189 flow [2025-03-13 21:40:27,313 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-03-13 21:40:27,317 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-03-13 21:40:27,317 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 189 flow [2025-03-13 21:40:27,318 INFO L472 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-03-13 21:40:27,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:27,318 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:27,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:40:27,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:27,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 169727944, now seen corresponding path program 1 times [2025-03-13 21:40:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252548187] [2025-03-13 21:40:27,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:27,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-13 21:40:27,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-13 21:40:27,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:27,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:27,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:27,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252548187] [2025-03-13 21:40:27,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252548187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:27,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:27,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:27,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136831943] [2025-03-13 21:40:27,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:27,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:27,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:27,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:27,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:27,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-03-13 21:40:27,560 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-03-13 21:40:27,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:27,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-03-13 21:40:27,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:31,020 INFO L124 PetriNetUnfolderBase]: 46522/71691 cut-off events. [2025-03-13 21:40:31,021 INFO L125 PetriNetUnfolderBase]: For 13700/13700 co-relation queries the response was YES. [2025-03-13 21:40:31,184 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 2015. Compared 570658 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-03-13 21:40:31,409 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 193 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2025-03-13 21:40:31,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 228 transitions, 1054 flow [2025-03-13 21:40:31,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:40:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:40:31,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-03-13 21:40:31,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6360294117647058 [2025-03-13 21:40:31,416 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 189 flow. Second operand 8 states and 346 transitions. [2025-03-13 21:40:31,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 228 transitions, 1054 flow [2025-03-13 21:40:31,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 228 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:31,904 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 288 flow [2025-03-13 21:40:31,904 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-03-13 21:40:31,904 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-03-13 21:40:31,904 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 288 flow [2025-03-13 21:40:31,904 INFO L472 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-03-13 21:40:31,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:31,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:31,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:40:31,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:31,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:31,905 INFO L85 PathProgramCache]: Analyzing trace with hash 21709595, now seen corresponding path program 1 times [2025-03-13 21:40:31,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:31,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111785721] [2025-03-13 21:40:31,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:31,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:31,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:40:31,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:40:31,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:31,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:32,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111785721] [2025-03-13 21:40:32,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111785721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:32,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:32,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:32,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792932351] [2025-03-13 21:40:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:32,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:32,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:32,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:32,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-03-13 21:40:32,049 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-03-13 21:40:32,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:32,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-03-13 21:40:32,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:37,447 INFO L124 PetriNetUnfolderBase]: 60127/97560 cut-off events. [2025-03-13 21:40:37,447 INFO L125 PetriNetUnfolderBase]: For 39044/39499 co-relation queries the response was YES. [2025-03-13 21:40:37,755 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 2964. Compared 869013 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-03-13 21:40:38,046 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 215 selfloop transitions, 17 changer transitions 3/257 dead transitions. [2025-03-13 21:40:38,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 257 transitions, 1362 flow [2025-03-13 21:40:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:40:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:40:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 363 transitions. [2025-03-13 21:40:38,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6672794117647058 [2025-03-13 21:40:38,048 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 288 flow. Second operand 8 states and 363 transitions. [2025-03-13 21:40:38,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 257 transitions, 1362 flow [2025-03-13 21:40:40,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 257 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:40,078 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 397 flow [2025-03-13 21:40:40,080 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-03-13 21:40:40,081 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 30 predicate places. [2025-03-13 21:40:40,081 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 397 flow [2025-03-13 21:40:40,081 INFO L472 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-03-13 21:40:40,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:40,082 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-03-13 21:40:40,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:40:40,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:40,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1406828454, now seen corresponding path program 1 times [2025-03-13 21:40:40,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:40,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935826952] [2025-03-13 21:40:40,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:40,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:40:40,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:40:40,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:40,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:40,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:40,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935826952] [2025-03-13 21:40:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935826952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165535631] [2025-03-13 21:40:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:40,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:40:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:40,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:40:40,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:40:40,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-03-13 21:40:40,140 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-03-13 21:40:40,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:40,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-03-13 21:40:40,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:44,574 INFO L124 PetriNetUnfolderBase]: 38911/67064 cut-off events. [2025-03-13 21:40:44,574 INFO L125 PetriNetUnfolderBase]: For 42546/43748 co-relation queries the response was YES. [2025-03-13 21:40:44,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169962 conditions, 67064 events. 38911/67064 cut-off events. For 42546/43748 co-relation queries the response was YES. Maximal size of possible extension queue 2465. Compared 635032 event pairs, 13965 based on Foata normal form. 3031/69905 useless extension candidates. Maximal degree in co-relation 169936. Up to 34535 conditions per place. [2025-03-13 21:40:44,977 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 118 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2025-03-13 21:40:44,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 156 transitions, 942 flow [2025-03-13 21:40:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:40:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:40:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-03-13 21:40:44,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-03-13 21:40:44,979 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 397 flow. Second operand 3 states and 150 transitions. [2025-03-13 21:40:44,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 156 transitions, 942 flow [2025-03-13 21:40:46,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:40:46,697 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 468 flow [2025-03-13 21:40:46,697 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-03-13 21:40:46,698 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 33 predicate places. [2025-03-13 21:40:46,698 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 468 flow [2025-03-13 21:40:46,698 INFO L472 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-03-13 21:40:46,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:46,698 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-03-13 21:40:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:40:46,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:46,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash -540643279, now seen corresponding path program 1 times [2025-03-13 21:40:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109146917] [2025-03-13 21:40:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:46,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-13 21:40:46,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-13 21:40:46,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:46,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:46,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:46,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109146917] [2025-03-13 21:40:46,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109146917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:46,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:46,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:46,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051022922] [2025-03-13 21:40:46,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:46,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:46,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:46,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:46,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:46,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-03-13 21:40:46,838 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-03-13 21:40:46,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:46,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-03-13 21:40:46,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:48,950 INFO L124 PetriNetUnfolderBase]: 20387/36599 cut-off events. [2025-03-13 21:40:48,950 INFO L125 PetriNetUnfolderBase]: For 31331/32318 co-relation queries the response was YES. [2025-03-13 21:40:49,080 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 1156. Compared 326819 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-03-13 21:40:49,172 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 104 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2025-03-13 21:40:49,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 853 flow [2025-03-13 21:40:49,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:40:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:40:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-03-13 21:40:49,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-03-13 21:40:49,175 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 468 flow. Second operand 4 states and 160 transitions. [2025-03-13 21:40:49,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 853 flow [2025-03-13 21:40:49,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:49,789 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 475 flow [2025-03-13 21:40:49,790 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-03-13 21:40:49,790 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 35 predicate places. [2025-03-13 21:40:49,790 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 475 flow [2025-03-13 21:40:49,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:49,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:49,790 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-03-13 21:40:49,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:40:49,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1252353207, now seen corresponding path program 1 times [2025-03-13 21:40:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046559176] [2025-03-13 21:40:49,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:49,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:40:49,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:40:49,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:49,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:49,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:49,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046559176] [2025-03-13 21:40:49,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046559176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:49,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:40:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429153297] [2025-03-13 21:40:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:49,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:49,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:49,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:49,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:49,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-03-13 21:40:49,882 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-03-13 21:40:49,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:49,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-03-13 21:40:49,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:53,024 INFO L124 PetriNetUnfolderBase]: 24250/40163 cut-off events. [2025-03-13 21:40:53,025 INFO L125 PetriNetUnfolderBase]: For 36427/37332 co-relation queries the response was YES. [2025-03-13 21:40:53,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116803 conditions, 40163 events. 24250/40163 cut-off events. For 36427/37332 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 331586 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-03-13 21:40:53,386 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 202 selfloop transitions, 27 changer transitions 27/277 dead transitions. [2025-03-13 21:40:53,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 277 transitions, 1812 flow [2025-03-13 21:40:53,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-13 21:40:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-13 21:40:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2025-03-13 21:40:53,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2025-03-13 21:40:53,388 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 475 flow. Second operand 8 states and 350 transitions. [2025-03-13 21:40:53,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 277 transitions, 1812 flow [2025-03-13 21:40:53,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 277 transitions, 1758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:40:53,872 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 568 flow [2025-03-13 21:40:53,872 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-03-13 21:40:53,873 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2025-03-13 21:40:53,873 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 568 flow [2025-03-13 21:40:53,873 INFO L472 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-03-13 21:40:53,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:53,873 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-03-13 21:40:53,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:40:53,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:53,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1999365620, now seen corresponding path program 1 times [2025-03-13 21:40:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326426673] [2025-03-13 21:40:53,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:53,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:40:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:40:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:53,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326426673] [2025-03-13 21:40:53,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326426673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:53,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:53,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:40:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415064688] [2025-03-13 21:40:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:53,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:53,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:53,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:53,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:53,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-03-13 21:40:53,977 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-03-13 21:40:53,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:53,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-03-13 21:40:53,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:56,259 INFO L124 PetriNetUnfolderBase]: 22611/36777 cut-off events. [2025-03-13 21:40:56,259 INFO L125 PetriNetUnfolderBase]: For 36023/36088 co-relation queries the response was YES. [2025-03-13 21:40:56,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108630 conditions, 36777 events. 22611/36777 cut-off events. For 36023/36088 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 290366 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-03-13 21:40:56,422 INFO L140 encePairwiseOnDemand]: 56/68 looper letters, 204 selfloop transitions, 41 changer transitions 33/295 dead transitions. [2025-03-13 21:40:56,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 295 transitions, 1911 flow [2025-03-13 21:40:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:40:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:40:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2025-03-13 21:40:56,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5477941176470589 [2025-03-13 21:40:56,423 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 568 flow. Second operand 12 states and 447 transitions. [2025-03-13 21:40:56,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 295 transitions, 1911 flow [2025-03-13 21:40:56,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 295 transitions, 1908 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:56,674 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 742 flow [2025-03-13 21:40:56,674 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-03-13 21:40:56,676 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 49 predicate places. [2025-03-13 21:40:56,676 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 742 flow [2025-03-13 21:40:56,676 INFO L472 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-03-13 21:40:56,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:56,676 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-03-13 21:40:56,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:40:56,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:40:56,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:56,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1038792633, now seen corresponding path program 1 times [2025-03-13 21:40:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:56,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012243990] [2025-03-13 21:40:56,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:40:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:40:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:56,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-03-13 21:40:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012243990] [2025-03-13 21:40:56,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012243990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:56,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-13 21:40:56,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346421683] [2025-03-13 21:40:56,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:56,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:40:56,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-03-13 21:40:56,806 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-03-13 21:40:56,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:56,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-03-13 21:40:56,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:59,686 INFO L124 PetriNetUnfolderBase]: 21659/35745 cut-off events. [2025-03-13 21:40:59,687 INFO L125 PetriNetUnfolderBase]: For 54884/55371 co-relation queries the response was YES. [2025-03-13 21:40:59,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113975 conditions, 35745 events. 21659/35745 cut-off events. For 54884/55371 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 283561 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-03-13 21:40:59,825 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 107 selfloop transitions, 20 changer transitions 150/293 dead transitions. [2025-03-13 21:40:59,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 293 transitions, 2117 flow [2025-03-13 21:40:59,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:40:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:40:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 438 transitions. [2025-03-13 21:40:59,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855614973262032 [2025-03-13 21:40:59,827 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 742 flow. Second operand 11 states and 438 transitions. [2025-03-13 21:40:59,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 293 transitions, 2117 flow [2025-03-13 21:41:00,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 293 transitions, 2052 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-13 21:41:00,330 INFO L231 Difference]: Finished difference. Result has 121 places, 82 transitions, 457 flow [2025-03-13 21:41:00,330 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-03-13 21:41:00,331 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 51 predicate places. [2025-03-13 21:41:00,331 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 82 transitions, 457 flow [2025-03-13 21:41:00,331 INFO L472 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-03-13 21:41:00,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:41:00,331 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-03-13 21:41:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:41:00,331 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-03-13 21:41:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:41:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1973666562, now seen corresponding path program 1 times [2025-03-13 21:41:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:41:00,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126091571] [2025-03-13 21:41:00,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:41:00,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:41:00,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-13 21:41:00,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-13 21:41:00,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:41:00,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:41:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:41:00,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:41:00,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126091571] [2025-03-13 21:41:00,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126091571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:41:00,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:41:00,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:41:00,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101444344] [2025-03-13 21:41:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:41:00,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:41:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:41:00,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:41:00,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:41:00,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-03-13 21:41:00,445 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-03-13 21:41:00,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:41:00,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-03-13 21:41:00,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:41:00,583 INFO L124 PetriNetUnfolderBase]: 1444/2506 cut-off events. [2025-03-13 21:41:00,583 INFO L125 PetriNetUnfolderBase]: For 2629/2695 co-relation queries the response was YES. [2025-03-13 21:41:00,587 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 13578 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-03-13 21:41:00,589 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 0 selfloop transitions, 0 changer transitions 82/82 dead transitions. [2025-03-13 21:41:00,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 82 transitions, 553 flow [2025-03-13 21:41:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:41:00,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:41:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-13 21:41:00,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2025-03-13 21:41:00,590 INFO L175 Difference]: Start difference. First operand has 121 places, 82 transitions, 457 flow. Second operand 4 states and 148 transitions. [2025-03-13 21:41:00,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 82 transitions, 553 flow [2025-03-13 21:41:00,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 476 flow, removed 2 selfloop flow, removed 19 redundant places. [2025-03-13 21:41:00,595 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2025-03-13 21:41:00,595 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-03-13 21:41:00,595 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2025-03-13 21:41:00,595 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2025-03-13 21:41:00,596 INFO L472 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-03-13 21:41:00,597 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-03-13 21:41:00,598 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-03-13 21:41:00,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:41:00,599 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:41:00,602 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:41:00,602 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:41:00,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:41:00 BasicIcfg [2025-03-13 21:41:00,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:41:00,606 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:41:00,606 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:41:00,606 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:41:00,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:23" (3/4) ... [2025-03-13 21:41:00,607 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:41:00,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-03-13 21:41:00,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t3_fun [2025-03-13 21:41:00,610 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-13 21:41:00,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-03-13 21:41:00,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-13 21:41:00,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 21:41:00,614 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 21:41:00,664 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:41:00,664 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:41:00,664 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:41:00,665 INFO L158 Benchmark]: Toolchain (without parser) took 38224.10ms. Allocated memory was 142.6MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 109.7MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-03-13 21:41:00,666 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:41:00,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.16ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 89.1MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 21:41:00,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.84ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:41:00,669 INFO L158 Benchmark]: Boogie Preprocessor took 53.31ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:41:00,669 INFO L158 Benchmark]: IcfgBuilder took 577.19ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 103.8MB in the end (delta: -18.6MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2025-03-13 21:41:00,670 INFO L158 Benchmark]: TraceAbstraction took 37132.61ms. Allocated memory was 142.6MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 103.1MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2025-03-13 21:41:00,670 INFO L158 Benchmark]: Witness Printer took 58.59ms. Allocated memory is still 11.4GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:41:00,672 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.22ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.16ms. Allocated memory is still 142.6MB. Free memory was 109.7MB in the beginning and 89.1MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.84ms. Allocated memory is still 142.6MB. Free memory was 89.1MB in the beginning and 87.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.31ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 85.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 577.19ms. Allocated memory is still 142.6MB. Free memory was 85.2MB in the beginning and 103.8MB in the end (delta: -18.6MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. * TraceAbstraction took 37132.61ms. Allocated memory was 142.6MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 103.1MB in the beginning and 8.6GB in the end (delta: -8.5GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 58.59ms. Allocated memory is still 11.4GB. Free memory was 8.6GB in the beginning and 8.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: 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: 19]: 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: 19]: 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: 19]: 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, 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: 37.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1030 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1009 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 1.8s 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, 82 GetRequests, 26 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, 591 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-03-13 21:41:00,685 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