./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:36:30,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:36:30,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:36:30,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:36:30,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:36:30,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:36:30,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:36:30,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:36:30,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:36:30,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:36:30,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:36:30,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:36:30,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:36:30,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:36:30,712 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:36:30,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:36:30,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:36:30,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:30,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:30,715 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:36:30,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:36:30,716 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2025-01-09 16:36:30,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:36:30,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:36:30,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:36:30,926 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:36:30,926 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:36:30,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-01-09 16:36:32,043 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa92ad1c5/28657c8063a746279014ea4bec4a37c1/FLAG96298f0d6 [2025-01-09 16:36:32,343 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:36:32,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2025-01-09 16:36:32,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa92ad1c5/28657c8063a746279014ea4bec4a37c1/FLAG96298f0d6 [2025-01-09 16:36:32,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa92ad1c5/28657c8063a746279014ea4bec4a37c1 [2025-01-09 16:36:32,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:36:32,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:36:32,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:32,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:36:32,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:36:32,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38aa677e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32, skipping insertion in model container [2025-01-09 16:36:32,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:36:32,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-01-09 16:36:32,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:32,870 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:36:32,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2025-01-09 16:36:32,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:32,928 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:36:32,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32 WrapperNode [2025-01-09 16:36:32,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:32,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:32,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:36:32,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:36:32,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,955 INFO L138 Inliner]: procedures = 165, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2025-01-09 16:36:32,955 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:32,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:36:32,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:36:32,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:36:32,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,981 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-01-09 16:36:32,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:32,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:36:32,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:36:32,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:36:32,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:36:32,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (1/1) ... [2025-01-09 16:36:33,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:33,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:33,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:36:33,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-09 16:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2025-01-09 16:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 16:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 16:36:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:36:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:36:33,035 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:36:33,123 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:36:33,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:36:33,291 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:36:33,291 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:36:33,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:36:33,403 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:36:33,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:33 BoogieIcfgContainer [2025-01-09 16:36:33,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:36:33,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:36:33,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:36:33,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:36:33,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:32" (1/3) ... [2025-01-09 16:36:33,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602ada9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:33, skipping insertion in model container [2025-01-09 16:36:33,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:32" (2/3) ... [2025-01-09 16:36:33,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@602ada9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:33, skipping insertion in model container [2025-01-09 16:36:33,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:33" (3/3) ... [2025-01-09 16:36:33,410 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2025-01-09 16:36:33,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:36:33,420 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-01-09 16:36:33,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:36:33,460 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:36:33,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 148 flow [2025-01-09 16:36:33,530 INFO L124 PetriNetUnfolderBase]: 5/65 cut-off events. [2025-01-09 16:36:33,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:36:33,537 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 148 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-01-09 16:36:33,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 68 transitions, 148 flow [2025-01-09 16:36:33,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 65 transitions, 139 flow [2025-01-09 16:36:33,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:36:33,554 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;@2f294285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:36:33,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 16:36:33,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:36:33,565 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-01-09 16:36:33,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:36:33,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:33,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:33,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:33,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:33,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1047439611, now seen corresponding path program 1 times [2025-01-09 16:36:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314865613] [2025-01-09 16:36:33,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:33,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:33,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 16:36:33,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 16:36:33,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:33,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:33,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:33,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314865613] [2025-01-09 16:36:33,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314865613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:33,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:33,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668635358] [2025-01-09 16:36:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:33,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:33,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:33,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:33,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:33,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-01-09 16:36:33,896 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-01-09 16:36:33,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:33,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-01-09 16:36:33,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:36,630 INFO L124 PetriNetUnfolderBase]: 30713/46966 cut-off events. [2025-01-09 16:36:36,631 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-09 16:36:36,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90095 conditions, 46966 events. 30713/46966 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 1224. Compared 351067 event pairs, 7163 based on Foata normal form. 3860/49784 useless extension candidates. Maximal degree in co-relation 90084. Up to 11332 conditions per place. [2025-01-09 16:36:36,873 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 190 selfloop transitions, 11 changer transitions 0/220 dead transitions. [2025-01-09 16:36:36,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 220 transitions, 872 flow [2025-01-09 16:36:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:36:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:36:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 401 transitions. [2025-01-09 16:36:36,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7371323529411765 [2025-01-09 16:36:36,888 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 139 flow. Second operand 8 states and 401 transitions. [2025-01-09 16:36:36,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 220 transitions, 872 flow [2025-01-09 16:36:36,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 220 transitions, 862 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:36:36,901 INFO L231 Difference]: Finished difference. Result has 78 places, 69 transitions, 189 flow [2025-01-09 16:36:36,902 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-01-09 16:36:36,905 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-01-09 16:36:36,906 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 69 transitions, 189 flow [2025-01-09 16:36:36,906 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-01-09 16:36:36,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:36,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:36,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:36:36,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:36,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1610142895, now seen corresponding path program 1 times [2025-01-09 16:36:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577895207] [2025-01-09 16:36:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:36,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:36:36,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:36:36,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:36,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:37,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:37,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:37,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577895207] [2025-01-09 16:36:37,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577895207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:37,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:37,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:37,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719456436] [2025-01-09 16:36:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:37,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:37,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:37,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:37,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-01-09 16:36:37,062 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-01-09 16:36:37,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:37,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-01-09 16:36:37,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:40,398 INFO L124 PetriNetUnfolderBase]: 46522/71671 cut-off events. [2025-01-09 16:36:40,398 INFO L125 PetriNetUnfolderBase]: For 13700/13700 co-relation queries the response was YES. [2025-01-09 16:36:40,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153092 conditions, 71671 events. 46522/71671 cut-off events. For 13700/13700 co-relation queries the response was YES. Maximal size of possible extension queue 2020. Compared 569589 event pairs, 9900 based on Foata normal form. 0/70263 useless extension candidates. Maximal degree in co-relation 153078. Up to 27642 conditions per place. [2025-01-09 16:36:40,698 INFO L140 encePairwiseOnDemand]: 57/68 looper letters, 193 selfloop transitions, 17 changer transitions 0/228 dead transitions. [2025-01-09 16:36:40,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 228 transitions, 1054 flow [2025-01-09 16:36:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:36:40,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:36:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2025-01-09 16:36:40,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6360294117647058 [2025-01-09 16:36:40,700 INFO L175 Difference]: Start difference. First operand has 78 places, 69 transitions, 189 flow. Second operand 8 states and 346 transitions. [2025-01-09 16:36:40,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 228 transitions, 1054 flow [2025-01-09 16:36:41,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 228 transitions, 1054 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:36:41,159 INFO L231 Difference]: Finished difference. Result has 89 places, 82 transitions, 288 flow [2025-01-09 16:36:41,160 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-01-09 16:36:41,160 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 19 predicate places. [2025-01-09 16:36:41,161 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 82 transitions, 288 flow [2025-01-09 16:36:41,161 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-01-09 16:36:41,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:41,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:41,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:36:41,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:41,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash 719434576, now seen corresponding path program 1 times [2025-01-09 16:36:41,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:41,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078715397] [2025-01-09 16:36:41,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:41,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:36:41,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:36:41,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:41,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:41,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:41,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:41,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078715397] [2025-01-09 16:36:41,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078715397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:41,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647005746] [2025-01-09 16:36:41,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:41,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:41,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:41,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:41,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:41,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-01-09 16:36:41,281 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-01-09 16:36:41,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:41,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-01-09 16:36:41,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:46,265 INFO L124 PetriNetUnfolderBase]: 60127/97639 cut-off events. [2025-01-09 16:36:46,265 INFO L125 PetriNetUnfolderBase]: For 38504/38959 co-relation queries the response was YES. [2025-01-09 16:36:46,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226000 conditions, 97639 events. 60127/97639 cut-off events. For 38504/38959 co-relation queries the response was YES. Maximal size of possible extension queue 2970. Compared 870448 event pairs, 20848 based on Foata normal form. 0/96306 useless extension candidates. Maximal degree in co-relation 225980. Up to 41717 conditions per place. [2025-01-09 16:36:46,796 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 215 selfloop transitions, 17 changer transitions 3/257 dead transitions. [2025-01-09 16:36:46,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 257 transitions, 1362 flow [2025-01-09 16:36:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:36:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:36:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 363 transitions. [2025-01-09 16:36:46,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6672794117647058 [2025-01-09 16:36:46,797 INFO L175 Difference]: Start difference. First operand has 89 places, 82 transitions, 288 flow. Second operand 8 states and 363 transitions. [2025-01-09 16:36:46,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 257 transitions, 1362 flow [2025-01-09 16:36:48,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 257 transitions, 1362 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:36:48,942 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 397 flow [2025-01-09 16:36:48,942 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-01-09 16:36:48,943 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 30 predicate places. [2025-01-09 16:36:48,943 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 397 flow [2025-01-09 16:36:48,943 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-01-09 16:36:48,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:48,943 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-01-09 16:36:48,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:36:48,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:48,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:48,944 INFO L85 PathProgramCache]: Analyzing trace with hash 400966673, now seen corresponding path program 1 times [2025-01-09 16:36:48,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349572017] [2025-01-09 16:36:48,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:48,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:48,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:36:48,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:36:48,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:48,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349572017] [2025-01-09 16:36:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349572017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:49,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874151075] [2025-01-09 16:36:49,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:49,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:36:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:49,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:36:49,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:36:49,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-01-09 16:36:49,008 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-01-09 16:36:49,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:49,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-01-09 16:36:49,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:52,926 INFO L124 PetriNetUnfolderBase]: 38911/66921 cut-off events. [2025-01-09 16:36:52,926 INFO L125 PetriNetUnfolderBase]: For 41210/42412 co-relation queries the response was YES. [2025-01-09 16:36:53,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169790 conditions, 66921 events. 38911/66921 cut-off events. For 41210/42412 co-relation queries the response was YES. Maximal size of possible extension queue 2467. Compared 631582 event pairs, 13965 based on Foata normal form. 3031/69788 useless extension candidates. Maximal degree in co-relation 169764. Up to 34535 conditions per place. [2025-01-09 16:36:53,296 INFO L140 encePairwiseOnDemand]: 55/68 looper letters, 118 selfloop transitions, 13 changer transitions 0/156 dead transitions. [2025-01-09 16:36:53,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 156 transitions, 942 flow [2025-01-09 16:36:53,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:36:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:36:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2025-01-09 16:36:53,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7352941176470589 [2025-01-09 16:36:53,297 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 397 flow. Second operand 3 states and 150 transitions. [2025-01-09 16:36:53,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 156 transitions, 942 flow [2025-01-09 16:36:55,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 156 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 16:36:55,246 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 468 flow [2025-01-09 16:36:55,246 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-01-09 16:36:55,246 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 33 predicate places. [2025-01-09 16:36:55,246 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 468 flow [2025-01-09 16:36:55,246 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-01-09 16:36:55,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:55,246 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-01-09 16:36:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:36:55,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:55,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 709116081, now seen corresponding path program 1 times [2025-01-09 16:36:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:55,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458746704] [2025-01-09 16:36:55,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:55,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 16:36:55,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 16:36:55,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:55,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:55,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:55,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:55,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458746704] [2025-01-09 16:36:55,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458746704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:55,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158682724] [2025-01-09 16:36:55,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:55,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:55,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:55,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:55,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:55,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-01-09 16:36:55,390 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-01-09 16:36:55,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:55,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-01-09 16:36:55,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:58,181 INFO L124 PetriNetUnfolderBase]: 20387/36627 cut-off events. [2025-01-09 16:36:58,182 INFO L125 PetriNetUnfolderBase]: For 30812/31812 co-relation queries the response was YES. [2025-01-09 16:36:58,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103013 conditions, 36627 events. 20387/36627 cut-off events. For 30812/31812 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 327574 event pairs, 5653 based on Foata normal form. 1395/37913 useless extension candidates. Maximal degree in co-relation 102985. Up to 18926 conditions per place. [2025-01-09 16:36:58,354 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 104 selfloop transitions, 10 changer transitions 0/139 dead transitions. [2025-01-09 16:36:58,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 853 flow [2025-01-09 16:36:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:36:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:36:58,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2025-01-09 16:36:58,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2025-01-09 16:36:58,355 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 468 flow. Second operand 4 states and 160 transitions. [2025-01-09 16:36:58,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 853 flow [2025-01-09 16:36:58,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:58,886 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 475 flow [2025-01-09 16:36:58,886 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-01-09 16:36:58,886 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 35 predicate places. [2025-01-09 16:36:58,886 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 475 flow [2025-01-09 16:36:58,886 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-01-09 16:36:58,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:58,886 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-01-09 16:36:58,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:36:58,887 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:36:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 236048221, now seen corresponding path program 1 times [2025-01-09 16:36:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854461964] [2025-01-09 16:36:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:58,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:36:58,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:36:58,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:58,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:59,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854461964] [2025-01-09 16:36:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854461964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:59,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:59,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:36:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876909510] [2025-01-09 16:36:59,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:59,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:59,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:59,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:36:59,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-01-09 16:36:59,018 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-01-09 16:36:59,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:59,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-01-09 16:36:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:01,289 INFO L124 PetriNetUnfolderBase]: 24250/40158 cut-off events. [2025-01-09 16:37:01,289 INFO L125 PetriNetUnfolderBase]: For 35796/36716 co-relation queries the response was YES. [2025-01-09 16:37:01,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116793 conditions, 40158 events. 24250/40158 cut-off events. For 35796/36716 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 331715 event pairs, 4853 based on Foata normal form. 545/40624 useless extension candidates. Maximal degree in co-relation 116764. Up to 11342 conditions per place. [2025-01-09 16:37:01,497 INFO L140 encePairwiseOnDemand]: 62/68 looper letters, 202 selfloop transitions, 27 changer transitions 27/277 dead transitions. [2025-01-09 16:37:01,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 277 transitions, 1812 flow [2025-01-09 16:37:01,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:37:01,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:37:01,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2025-01-09 16:37:01,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433823529411765 [2025-01-09 16:37:01,498 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 475 flow. Second operand 8 states and 350 transitions. [2025-01-09 16:37:01,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 277 transitions, 1812 flow [2025-01-09 16:37:02,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 277 transitions, 1758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:37:02,137 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 568 flow [2025-01-09 16:37:02,138 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-01-09 16:37:02,138 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2025-01-09 16:37:02,138 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 568 flow [2025-01-09 16:37:02,138 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-01-09 16:37:02,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:02,138 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-01-09 16:37:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:37:02,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:37:02,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1083601452, now seen corresponding path program 1 times [2025-01-09 16:37:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212166471] [2025-01-09 16:37:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:37:02,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:37:02,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:02,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:02,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:02,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212166471] [2025-01-09 16:37:02,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212166471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:02,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:02,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:37:02,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862372845] [2025-01-09 16:37:02,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:02,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:37:02,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:02,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:37:02,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:37:02,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 68 [2025-01-09 16:37:02,246 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-01-09 16:37:02,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:02,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 68 [2025-01-09 16:37:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:04,778 INFO L124 PetriNetUnfolderBase]: 22611/36771 cut-off events. [2025-01-09 16:37:04,778 INFO L125 PetriNetUnfolderBase]: For 36052/36123 co-relation queries the response was YES. [2025-01-09 16:37:04,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108624 conditions, 36771 events. 22611/36771 cut-off events. For 36052/36123 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 290088 event pairs, 4720 based on Foata normal form. 650/37390 useless extension candidates. Maximal degree in co-relation 108596. Up to 7735 conditions per place. [2025-01-09 16:37:04,886 INFO L140 encePairwiseOnDemand]: 56/68 looper letters, 204 selfloop transitions, 41 changer transitions 33/295 dead transitions. [2025-01-09 16:37:04,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 295 transitions, 1911 flow [2025-01-09 16:37:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:37:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:37:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 447 transitions. [2025-01-09 16:37:04,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5477941176470589 [2025-01-09 16:37:04,888 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 568 flow. Second operand 12 states and 447 transitions. [2025-01-09 16:37:04,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 295 transitions, 1911 flow [2025-01-09 16:37:05,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 295 transitions, 1908 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:37:05,122 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 742 flow [2025-01-09 16:37:05,123 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-01-09 16:37:05,123 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 49 predicate places. [2025-01-09 16:37:05,123 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 742 flow [2025-01-09 16:37:05,123 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-01-09 16:37:05,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:05,123 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-01-09 16:37:05,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:37:05,124 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:37:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 288745811, now seen corresponding path program 1 times [2025-01-09 16:37:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403262161] [2025-01-09 16:37:05,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:05,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:37:05,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:37:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:05,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:05,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:05,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403262161] [2025-01-09 16:37:05,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403262161] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:05,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:05,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 16:37:05,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083603226] [2025-01-09 16:37:05,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:05,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:37:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:05,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:37:05,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 16:37:05,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 68 [2025-01-09 16:37:05,236 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-01-09 16:37:05,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:05,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 68 [2025-01-09 16:37:05,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:07,446 INFO L124 PetriNetUnfolderBase]: 21659/35739 cut-off events. [2025-01-09 16:37:07,446 INFO L125 PetriNetUnfolderBase]: For 54189/54682 co-relation queries the response was YES. [2025-01-09 16:37:07,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113969 conditions, 35739 events. 21659/35739 cut-off events. For 54189/54682 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 283306 event pairs, 5623 based on Foata normal form. 422/36121 useless extension candidates. Maximal degree in co-relation 113937. Up to 7264 conditions per place. [2025-01-09 16:37:07,560 INFO L140 encePairwiseOnDemand]: 61/68 looper letters, 107 selfloop transitions, 20 changer transitions 150/293 dead transitions. [2025-01-09 16:37:07,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 293 transitions, 2117 flow [2025-01-09 16:37:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 16:37:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 16:37:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 438 transitions. [2025-01-09 16:37:07,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855614973262032 [2025-01-09 16:37:07,561 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 742 flow. Second operand 11 states and 438 transitions. [2025-01-09 16:37:07,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 293 transitions, 2117 flow [2025-01-09 16:37:07,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 293 transitions, 2052 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-01-09 16:37:07,956 INFO L231 Difference]: Finished difference. Result has 121 places, 82 transitions, 457 flow [2025-01-09 16:37:07,957 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-01-09 16:37:07,957 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 51 predicate places. [2025-01-09 16:37:07,957 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 82 transitions, 457 flow [2025-01-09 16:37:07,957 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-01-09 16:37:07,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:07,958 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-01-09 16:37:07,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:37:07,958 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2025-01-09 16:37:07,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:07,958 INFO L85 PathProgramCache]: Analyzing trace with hash -700491726, now seen corresponding path program 1 times [2025-01-09 16:37:07,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:07,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685107662] [2025-01-09 16:37:07,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:07,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:07,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 16:37:07,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 16:37:07,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:07,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:08,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685107662] [2025-01-09 16:37:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685107662] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:37:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987607414] [2025-01-09 16:37:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:37:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:37:08,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:37:08,053 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 68 [2025-01-09 16:37:08,053 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-01-09 16:37:08,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:08,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 68 [2025-01-09 16:37:08,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:08,368 INFO L124 PetriNetUnfolderBase]: 1444/2506 cut-off events. [2025-01-09 16:37:08,368 INFO L125 PetriNetUnfolderBase]: For 2626/2692 co-relation queries the response was YES. [2025-01-09 16:37:08,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7258 conditions, 2506 events. 1444/2506 cut-off events. For 2626/2692 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 13539 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-01-09 16:37:08,373 INFO L140 encePairwiseOnDemand]: 58/68 looper letters, 0 selfloop transitions, 0 changer transitions 82/82 dead transitions. [2025-01-09 16:37:08,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 82 transitions, 553 flow [2025-01-09 16:37:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:37:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:37:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-01-09 16:37:08,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5441176470588235 [2025-01-09 16:37:08,374 INFO L175 Difference]: Start difference. First operand has 121 places, 82 transitions, 457 flow. Second operand 4 states and 148 transitions. [2025-01-09 16:37:08,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 82 transitions, 553 flow [2025-01-09 16:37:08,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 476 flow, removed 2 selfloop flow, removed 19 redundant places. [2025-01-09 16:37:08,379 INFO L231 Difference]: Finished difference. Result has 76 places, 0 transitions, 0 flow [2025-01-09 16:37:08,379 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-01-09 16:37:08,380 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 6 predicate places. [2025-01-09 16:37:08,380 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 0 transitions, 0 flow [2025-01-09 16:37:08,380 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-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2025-01-09 16:37:08,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2025-01-09 16:37:08,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:37:08,382 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:08,385 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 16:37:08,385 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 16:37:08,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:37:08 BasicIcfg [2025-01-09 16:37:08,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 16:37:08,389 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 16:37:08,389 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 16:37:08,389 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 16:37:08,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:33" (3/4) ... [2025-01-09 16:37:08,392 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 16:37:08,394 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-01-09 16:37:08,394 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2025-01-09 16:37:08,395 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 16:37:08,397 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-01-09 16:37:08,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 16:37:08,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 16:37:08,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 16:37:08,447 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 16:37:08,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 16:37:08,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 16:37:08,450 INFO L158 Benchmark]: Toolchain (without parser) took 35841.52ms. Allocated memory was 142.6MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 105.0MB in the beginning and 8.5GB in the end (delta: -8.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2025-01-09 16:37:08,450 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:37:08,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.98ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 16:37:08,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.19ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 16:37:08,452 INFO L158 Benchmark]: Boogie Preprocessor took 40.48ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:37:08,452 INFO L158 Benchmark]: RCFGBuilder took 406.39ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 42.9MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 16:37:08,452 INFO L158 Benchmark]: TraceAbstraction took 34983.83ms. Allocated memory was 142.6MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 41.7MB in the beginning and 8.5GB in the end (delta: -8.5GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2025-01-09 16:37:08,452 INFO L158 Benchmark]: Witness Printer took 59.01ms. Allocated memory is still 11.2GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 16:37:08,454 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.14ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.98ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 84.8MB in the end (delta: 20.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.19ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.48ms. Allocated memory is still 142.6MB. Free memory was 82.7MB in the beginning and 80.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 406.39ms. Allocated memory is still 142.6MB. Free memory was 80.6MB in the beginning and 42.9MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34983.83ms. Allocated memory was 142.6MB in the beginning and 11.2GB in the end (delta: 11.0GB). Free memory was 41.7MB in the beginning and 8.5GB in the end (delta: -8.5GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 59.01ms. Allocated memory is still 11.2GB. Free memory was 8.5GB in the beginning and 8.5GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 34.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 33.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.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2743 IncrementalHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 4 mSDtfsCounter, 2743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 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, 0.9s 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-01-09 16:37:08,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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