./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/13-privatized_68-pfscan_protected_loop_minimal_interval_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 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:08:41,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:08:41,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:08:41,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:08:41,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:08:41,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:08:41,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:08:41,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:08:41,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:08:41,686 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:08:41,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:08:41,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:08:41,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:08:41,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:08:41,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:08:41,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:08:41,689 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:08:41,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:41,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:08:41,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:08:41,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:08:41,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:08:41,691 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-02-08 01:08:41,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:08:41,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:08:41,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:08:41,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:08:41,905 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:08:41,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 01:08:43,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74da6288/c7770435e1064d41b2e91df5a28a30be/FLAG679506cd4 [2025-02-08 01:08:43,306 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:08:43,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 01:08:43,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74da6288/c7770435e1064d41b2e91df5a28a30be/FLAG679506cd4 [2025-02-08 01:08:43,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f74da6288/c7770435e1064d41b2e91df5a28a30be [2025-02-08 01:08:43,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:08:43,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:08:43,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:43,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:08:43,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:08:43,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:43,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669f8046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43, skipping insertion in model container [2025-02-08 01:08:43,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:43,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:08:43,773 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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-02-08 01:08:43,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:43,927 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:08:43,936 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/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-02-08 01:08:43,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:08:43,989 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:08:43,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43 WrapperNode [2025-02-08 01:08:43,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:08:43,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:43,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:08:43,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:08:43,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,014 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-02-08 01:08:44,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:08:44,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:08:44,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:08:44,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:08:44,022 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,036 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-02-08 01:08:44,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:08:44,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:08:44,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:08:44,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:08:44,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (1/1) ... [2025-02-08 01:08:44,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:08:44,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:08:44,070 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-02-08 01:08:44,072 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-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-02-08 01:08:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 01:08:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:08:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:08:44,089 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:08:44,199 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:08:44,200 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750: havoc main_#t~ret19#1; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-1: assume { :end_inline_pqueue_put } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-2: havoc pqueue_put_#in~qp#1.base, pqueue_put_#in~qp#1.offset; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-3: havoc pqueue_put_#t~ret1#1, pqueue_put_#t~mem2#1, pqueue_put_#t~mem3#1, pqueue_put_#t~post4#1, pqueue_put_#t~ret5#1, pqueue_put_~qp#1.base, pqueue_put_~qp#1.offset; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L750-4: main_#t~ret19#1 := pqueue_put_#res#1; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-1: havoc main_#t~post20#1; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-2: main_~i~0#1 := 1 + main_#t~post20#1; [2025-02-08 01:08:44,322 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L749-3: main_#t~post20#1 := main_~i~0#1; [2025-02-08 01:08:44,380 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739: havoc #t~ret15#1; [2025-02-08 01:08:44,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-1: assume { :end_inline_pqueue_get } true;assume -2147483648 <= #t~ret15#1 && #t~ret15#1 <= 2147483647; [2025-02-08 01:08:44,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-2: havoc pqueue_get_#in~qp#1.base, pqueue_get_#in~qp#1.offset; [2025-02-08 01:08:44,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-3: havoc pqueue_get_#t~ret6#1, pqueue_get_#t~mem7#1, pqueue_get_#t~mem8#1, pqueue_get_#t~mem9#1, pqueue_get_#t~mem10#1, pqueue_get_#t~mem11#1, pqueue_get_#t~post12#1, pqueue_get_#t~ret13#1, pqueue_get_#t~ret14#1, pqueue_get_~qp#1.base, pqueue_get_~qp#1.offset, pqueue_get_~got~0#1; [2025-02-08 01:08:44,381 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L739-4: #t~ret15#1 := pqueue_get_#res#1; [2025-02-08 01:08:44,382 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:08:44,382 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:08:44,476 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:08:44,476 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:08:44,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:44 BoogieIcfgContainer [2025-02-08 01:08:44,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:08:44,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:08:44,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:08:44,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:08:44,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:08:43" (1/3) ... [2025-02-08 01:08:44,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a634713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:44, skipping insertion in model container [2025-02-08 01:08:44,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:08:43" (2/3) ... [2025-02-08 01:08:44,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a634713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:08:44, skipping insertion in model container [2025-02-08 01:08:44,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:44" (3/3) ... [2025-02-08 01:08:44,483 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-02-08 01:08:44,494 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:08:44,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 33 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-02-08 01:08:44,495 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:08:44,537 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 01:08:44,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 37 transitions, 78 flow [2025-02-08 01:08:44,587 INFO L124 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-02-08 01:08:44,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:44,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 5/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-02-08 01:08:44,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 37 transitions, 78 flow [2025-02-08 01:08:44,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 25 transitions, 53 flow [2025-02-08 01:08:44,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:08:44,608 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;@4635d791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:08:44,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:08:44,617 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:08:44,617 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-02-08 01:08:44,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:44,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:44,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:44,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:44,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:44,625 INFO L85 PathProgramCache]: Analyzing trace with hash -2129300360, now seen corresponding path program 1 times [2025-02-08 01:08:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588721844] [2025-02-08 01:08:44,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:44,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 01:08:44,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 01:08:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:44,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588721844] [2025-02-08 01:08:44,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588721844] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:44,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:44,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:08:44,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556141620] [2025-02-08 01:08:44,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:08:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:44,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:08:44,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:08:44,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-02-08 01:08:44,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:44,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:44,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-02-08 01:08:44,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:44,898 INFO L124 PetriNetUnfolderBase]: 53/156 cut-off events. [2025-02-08 01:08:44,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:44,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 156 events. 53/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 638 event pairs, 45 based on Foata normal form. 7/139 useless extension candidates. Maximal degree in co-relation 266. Up to 115 conditions per place. [2025-02-08 01:08:44,900 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 16 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-02-08 01:08:44,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 23 transitions, 81 flow [2025-02-08 01:08:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:08:44,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:08:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 42 transitions. [2025-02-08 01:08:44,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-02-08 01:08:44,910 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 53 flow. Second operand 2 states and 42 transitions. [2025-02-08 01:08:44,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 23 transitions, 81 flow [2025-02-08 01:08:44,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 01:08:44,914 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 48 flow [2025-02-08 01:08:44,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2025-02-08 01:08:44,918 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2025-02-08 01:08:44,919 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 48 flow [2025-02-08 01:08:44,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:08:44,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:44,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:44,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:08:44,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:44,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash -2129268582, now seen corresponding path program 1 times [2025-02-08 01:08:44,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428195814] [2025-02-08 01:08:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:44,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 01:08:44,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 01:08:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428195814] [2025-02-08 01:08:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428195814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:45,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:45,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 01:08:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869015092] [2025-02-08 01:08:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:45,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:45,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:45,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:45,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:45,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:45,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-02-08 01:08:45,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:45,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:45,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:45,350 INFO L124 PetriNetUnfolderBase]: 70/166 cut-off events. [2025-02-08 01:08:45,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:08:45,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 166 events. 70/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 602 event pairs, 6 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 320. Up to 59 conditions per place. [2025-02-08 01:08:45,355 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2025-02-08 01:08:45,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 174 flow [2025-02-08 01:08:45,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:08:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:08:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-02-08 01:08:45,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4099099099099099 [2025-02-08 01:08:45,358 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 48 flow. Second operand 6 states and 91 transitions. [2025-02-08 01:08:45,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 174 flow [2025-02-08 01:08:45,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:08:45,360 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 106 flow [2025-02-08 01:08:45,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-02-08 01:08:45,362 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2025-02-08 01:08:45,362 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 106 flow [2025-02-08 01:08:45,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-02-08 01:08:45,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:45,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:45,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 01:08:45,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:45,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:45,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1582851122, now seen corresponding path program 1 times [2025-02-08 01:08:45,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:45,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169832452] [2025-02-08 01:08:45,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:45,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:45,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 01:08:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 01:08:45,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:45,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169832452] [2025-02-08 01:08:45,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169832452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:45,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:45,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:08:45,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460022650] [2025-02-08 01:08:45,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:45,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:45,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:45,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:45,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:45,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:45,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 106 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-08 01:08:45,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:45,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:45,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:45,628 INFO L124 PetriNetUnfolderBase]: 71/172 cut-off events. [2025-02-08 01:08:45,628 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-02-08 01:08:45,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 172 events. 71/172 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 630 event pairs, 23 based on Foata normal form. 11/174 useless extension candidates. Maximal degree in co-relation 420. Up to 95 conditions per place. [2025-02-08 01:08:45,632 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 32 selfloop transitions, 10 changer transitions 14/60 dead transitions. [2025-02-08 01:08:45,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 298 flow [2025-02-08 01:08:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:08:45,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:08:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2025-02-08 01:08:45,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45045045045045046 [2025-02-08 01:08:45,634 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 106 flow. Second operand 6 states and 100 transitions. [2025-02-08 01:08:45,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 298 flow [2025-02-08 01:08:45,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:08:45,636 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 165 flow [2025-02-08 01:08:45,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2025-02-08 01:08:45,636 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2025-02-08 01:08:45,636 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 165 flow [2025-02-08 01:08:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-02-08 01:08:45,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:45,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:45,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:08:45,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:45,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:45,637 INFO L85 PathProgramCache]: Analyzing trace with hash -848594775, now seen corresponding path program 1 times [2025-02-08 01:08:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820211740] [2025-02-08 01:08:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:08:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:45,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:08:45,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:45,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:45,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:45,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820211740] [2025-02-08 01:08:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820211740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:08:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567032882] [2025-02-08 01:08:45,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:08:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:45,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:08:45,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:08:45,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-02-08 01:08:45,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-08 01:08:45,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:45,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-02-08 01:08:45,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:46,064 INFO L124 PetriNetUnfolderBase]: 76/215 cut-off events. [2025-02-08 01:08:46,064 INFO L125 PetriNetUnfolderBase]: For 233/239 co-relation queries the response was YES. [2025-02-08 01:08:46,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 215 events. 76/215 cut-off events. For 233/239 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 999 event pairs, 17 based on Foata normal form. 3/218 useless extension candidates. Maximal degree in co-relation 666. Up to 62 conditions per place. [2025-02-08 01:08:46,066 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 10 changer transitions 9/59 dead transitions. [2025-02-08 01:08:46,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 395 flow [2025-02-08 01:08:46,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:08:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:08:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2025-02-08 01:08:46,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4942084942084942 [2025-02-08 01:08:46,067 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 165 flow. Second operand 7 states and 128 transitions. [2025-02-08 01:08:46,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 395 flow [2025-02-08 01:08:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 379 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 01:08:46,070 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 209 flow [2025-02-08 01:08:46,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=209, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-02-08 01:08:46,071 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-02-08 01:08:46,071 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 209 flow [2025-02-08 01:08:46,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-08 01:08:46,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:46,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:46,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:08:46,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:46,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1971289395, now seen corresponding path program 2 times [2025-02-08 01:08:46,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:46,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230605151] [2025-02-08 01:08:46,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:08:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:46,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:08:46,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:46,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:08:46,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230605151] [2025-02-08 01:08:46,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230605151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:46,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:46,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:08:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625632023] [2025-02-08 01:08:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:46,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:08:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:46,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:08:46,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:08:46,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:46,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 209 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:46,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:46,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:46,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:46,719 INFO L124 PetriNetUnfolderBase]: 83/213 cut-off events. [2025-02-08 01:08:46,719 INFO L125 PetriNetUnfolderBase]: For 304/304 co-relation queries the response was YES. [2025-02-08 01:08:46,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 213 events. 83/213 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 908 event pairs, 26 based on Foata normal form. 1/214 useless extension candidates. Maximal degree in co-relation 690. Up to 105 conditions per place. [2025-02-08 01:08:46,720 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 29 selfloop transitions, 33 changer transitions 1/67 dead transitions. [2025-02-08 01:08:46,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 525 flow [2025-02-08 01:08:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 01:08:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 01:08:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-02-08 01:08:46,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3284823284823285 [2025-02-08 01:08:46,724 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 209 flow. Second operand 13 states and 158 transitions. [2025-02-08 01:08:46,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 525 flow [2025-02-08 01:08:46,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 501 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-02-08 01:08:46,730 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 390 flow [2025-02-08 01:08:46,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=390, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-02-08 01:08:46,730 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 35 predicate places. [2025-02-08 01:08:46,731 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 390 flow [2025-02-08 01:08:46,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:46,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:46,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:46,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:08:46,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 718311689, now seen corresponding path program 3 times [2025-02-08 01:08:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:46,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16541302] [2025-02-08 01:08:46,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 01:08:46,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:46,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:08:46,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:46,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 01:08:46,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16541302] [2025-02-08 01:08:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16541302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:47,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:47,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 01:08:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528761781] [2025-02-08 01:08:47,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:47,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 01:08:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:47,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 01:08:47,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 01:08:47,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:47,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 390 flow. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-02-08 01:08:47,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:47,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:47,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:47,320 INFO L124 PetriNetUnfolderBase]: 83/223 cut-off events. [2025-02-08 01:08:47,321 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2025-02-08 01:08:47,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 223 events. 83/223 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 968 event pairs, 22 based on Foata normal form. 8/231 useless extension candidates. Maximal degree in co-relation 842. Up to 102 conditions per place. [2025-02-08 01:08:47,323 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 31 selfloop transitions, 21 changer transitions 17/73 dead transitions. [2025-02-08 01:08:47,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 667 flow [2025-02-08 01:08:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 01:08:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 01:08:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2025-02-08 01:08:47,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35135135135135137 [2025-02-08 01:08:47,324 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 390 flow. Second operand 10 states and 130 transitions. [2025-02-08 01:08:47,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 667 flow [2025-02-08 01:08:47,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 601 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 01:08:47,331 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 401 flow [2025-02-08 01:08:47,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=401, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2025-02-08 01:08:47,331 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 45 predicate places. [2025-02-08 01:08:47,331 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 401 flow [2025-02-08 01:08:47,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 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-02-08 01:08:47,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:47,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:47,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 01:08:47,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:47,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash -504980523, now seen corresponding path program 4 times [2025-02-08 01:08:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:47,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225509958] [2025-02-08 01:08:47,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 01:08:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:47,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-02-08 01:08:47,350 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-02-08 01:08:47,351 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 01:08:47,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:47,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225509958] [2025-02-08 01:08:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225509958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 01:08:47,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846960764] [2025-02-08 01:08:47,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:47,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 01:08:47,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:47,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 01:08:47,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 01:08:47,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-02-08 01:08:47,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 401 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-08 01:08:47,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:47,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-02-08 01:08:47,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:47,498 INFO L124 PetriNetUnfolderBase]: 44/136 cut-off events. [2025-02-08 01:08:47,499 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2025-02-08 01:08:47,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 136 events. 44/136 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 528 event pairs, 1 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 581. Up to 50 conditions per place. [2025-02-08 01:08:47,501 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 6 changer transitions 12/69 dead transitions. [2025-02-08 01:08:47,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 636 flow [2025-02-08 01:08:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:08:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:08:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-02-08 01:08:47,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-08 01:08:47,502 INFO L175 Difference]: Start difference. First operand has 71 places, 49 transitions, 401 flow. Second operand 6 states and 111 transitions. [2025-02-08 01:08:47,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 636 flow [2025-02-08 01:08:47,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 568 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-08 01:08:47,506 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 324 flow [2025-02-08 01:08:47,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-02-08 01:08:47,506 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 41 predicate places. [2025-02-08 01:08:47,507 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 324 flow [2025-02-08 01:08:47,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-02-08 01:08:47,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:47,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:47,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:08:47,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:47,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1255322185, now seen corresponding path program 5 times [2025-02-08 01:08:47,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:47,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796487668] [2025-02-08 01:08:47,508 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 01:08:47,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:47,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-08 01:08:47,520 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:47,520 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:08:47,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:47,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:47,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796487668] [2025-02-08 01:08:47,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796487668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:47,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:47,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:08:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403928804] [2025-02-08 01:08:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:47,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:08:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:47,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:08:47,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:08:47,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:47,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 324 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:47,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:47,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:47,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:47,893 INFO L124 PetriNetUnfolderBase]: 78/214 cut-off events. [2025-02-08 01:08:47,894 INFO L125 PetriNetUnfolderBase]: For 637/637 co-relation queries the response was YES. [2025-02-08 01:08:47,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 214 events. 78/214 cut-off events. For 637/637 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 997 event pairs, 29 based on Foata normal form. 5/219 useless extension candidates. Maximal degree in co-relation 861. Up to 55 conditions per place. [2025-02-08 01:08:47,895 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 31 selfloop transitions, 11 changer transitions 25/71 dead transitions. [2025-02-08 01:08:47,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 616 flow [2025-02-08 01:08:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 01:08:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 01:08:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2025-02-08 01:08:47,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3464373464373464 [2025-02-08 01:08:47,897 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 324 flow. Second operand 11 states and 141 transitions. [2025-02-08 01:08:47,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 616 flow [2025-02-08 01:08:47,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 551 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-02-08 01:08:47,901 INFO L231 Difference]: Finished difference. Result has 67 places, 38 transitions, 244 flow [2025-02-08 01:08:47,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=244, PETRI_PLACES=67, PETRI_TRANSITIONS=38} [2025-02-08 01:08:47,902 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 41 predicate places. [2025-02-08 01:08:47,903 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 38 transitions, 244 flow [2025-02-08 01:08:47,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:47,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:47,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:47,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:08:47,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:47,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:47,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1053339205, now seen corresponding path program 6 times [2025-02-08 01:08:47,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:47,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396805163] [2025-02-08 01:08:47,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 01:08:47,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:47,914 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 2 equivalence classes. [2025-02-08 01:08:47,920 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:47,920 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-02-08 01:08:47,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 01:08:48,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396805163] [2025-02-08 01:08:48,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396805163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:48,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:48,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 01:08:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466088818] [2025-02-08 01:08:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:48,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:08:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:48,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:08:48,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:08:48,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-02-08 01:08:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 38 transitions, 244 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:48,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:48,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-02-08 01:08:48,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:48,198 INFO L124 PetriNetUnfolderBase]: 25/86 cut-off events. [2025-02-08 01:08:48,198 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-02-08 01:08:48,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 86 events. 25/86 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 260 event pairs, 16 based on Foata normal form. 7/93 useless extension candidates. Maximal degree in co-relation 347. Up to 55 conditions per place. [2025-02-08 01:08:48,199 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 13 selfloop transitions, 5 changer transitions 10/31 dead transitions. [2025-02-08 01:08:48,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 31 transitions, 261 flow [2025-02-08 01:08:48,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 01:08:48,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 01:08:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2025-02-08 01:08:48,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3141891891891892 [2025-02-08 01:08:48,200 INFO L175 Difference]: Start difference. First operand has 67 places, 38 transitions, 244 flow. Second operand 8 states and 93 transitions. [2025-02-08 01:08:48,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 31 transitions, 261 flow [2025-02-08 01:08:48,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 31 transitions, 179 flow, removed 14 selfloop flow, removed 19 redundant places. [2025-02-08 01:08:48,201 INFO L231 Difference]: Finished difference. Result has 48 places, 19 transitions, 82 flow [2025-02-08 01:08:48,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=82, PETRI_PLACES=48, PETRI_TRANSITIONS=19} [2025-02-08 01:08:48,202 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-02-08 01:08:48,202 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 19 transitions, 82 flow [2025-02-08 01:08:48,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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-02-08 01:08:48,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:08:48,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:08:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:08:48,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:08:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:08:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2137155717, now seen corresponding path program 7 times [2025-02-08 01:08:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:08:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098506858] [2025-02-08 01:08:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 01:08:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:08:48,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:08:48,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:08:48,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:08:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:08:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 01:08:48,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:08:48,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098506858] [2025-02-08 01:08:48,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098506858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:08:48,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:08:48,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:08:48,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653225098] [2025-02-08 01:08:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:08:48,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 01:08:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:08:48,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 01:08:48,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 01:08:48,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-02-08 01:08:48,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 19 transitions, 82 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-08 01:08:48,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:08:48,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-02-08 01:08:48,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:08:48,396 INFO L124 PetriNetUnfolderBase]: 6/31 cut-off events. [2025-02-08 01:08:48,396 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 01:08:48,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 31 events. 6/31 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 5/35 useless extension candidates. Maximal degree in co-relation 88. Up to 11 conditions per place. [2025-02-08 01:08:48,396 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2025-02-08 01:08:48,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 18 transitions, 106 flow [2025-02-08 01:08:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 01:08:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 01:08:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-02-08 01:08:48,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3861003861003861 [2025-02-08 01:08:48,397 INFO L175 Difference]: Start difference. First operand has 48 places, 19 transitions, 82 flow. Second operand 7 states and 100 transitions. [2025-02-08 01:08:48,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 18 transitions, 106 flow [2025-02-08 01:08:48,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 18 transitions, 84 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-02-08 01:08:48,398 INFO L231 Difference]: Finished difference. Result has 28 places, 0 transitions, 0 flow [2025-02-08 01:08:48,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=28, PETRI_TRANSITIONS=0} [2025-02-08 01:08:48,399 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-02-08 01:08:48,399 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 0 transitions, 0 flow [2025-02-08 01:08:48,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 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-02-08 01:08:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-08 01:08:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-08 01:08:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-08 01:08:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-08 01:08:48,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-08 01:08:48,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 01:08:48,402 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-02-08 01:08:48,405 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 01:08:48,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 01:08:48,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 01:08:48 BasicIcfg [2025-02-08 01:08:48,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 01:08:48,410 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 01:08:48,410 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 01:08:48,410 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 01:08:48,410 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:08:44" (3/4) ... [2025-02-08 01:08:48,412 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 01:08:48,413 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-02-08 01:08:48,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2025-02-08 01:08:48,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 01:08:48,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-08 01:08:48,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 01:08:48,419 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 01:08:48,470 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 01:08:48,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 01:08:48,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 01:08:48,471 INFO L158 Benchmark]: Toolchain (without parser) took 4840.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 132.6MB in the beginning and 156.1MB in the end (delta: -23.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-02-08 01:08:48,472 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:48,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.07ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 112.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 01:08:48,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.70ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:08:48,472 INFO L158 Benchmark]: Boogie Preprocessor took 30.14ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:48,472 INFO L158 Benchmark]: IcfgBuilder took 430.96ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 77.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-08 01:08:48,473 INFO L158 Benchmark]: TraceAbstraction took 3931.67ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.0MB in the beginning and 162.3MB in the end (delta: -85.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 01:08:48,473 INFO L158 Benchmark]: Witness Printer took 61.16ms. Allocated memory is still 201.3MB. Free memory was 160.3MB in the beginning and 156.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 01:08:48,474 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.24ms. Allocated memory is still 201.3MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.07ms. Allocated memory is still 167.8MB. Free memory was 132.6MB in the beginning and 112.4MB in the end (delta: 20.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.70ms. Allocated memory is still 167.8MB. Free memory was 112.4MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.14ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 430.96ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 77.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3931.67ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.0MB in the beginning and 162.3MB in the end (delta: -85.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.16ms. Allocated memory is still 201.3MB. Free memory was 160.3MB in the beginning and 156.1MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 57 locations, 5 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: 3.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 323 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 311 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1102 IncrementalHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 10 mSDtfsCounter, 1102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=401occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 129 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 846 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3/3 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 01:08:48,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE