/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_91-arrayloop2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:18:27,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:18:27,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:18:27,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:18:27,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:18:27,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:18:27,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:18:27,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:18:27,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:18:27,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:18:27,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:18:27,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:18:27,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:18:27,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:18:27,467 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:18:27,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:18:27,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:18:27,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:27,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:27,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:18:27,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:18:27,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:18:27,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:18:27,470 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:18:27,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:18:27,470 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:18:27,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:18:27,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:18:27,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:18:27,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:18:27,706 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:18:27,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-04-14 00:18:29,080 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecc18ef4/fdf16226ff7247539e6ff632837b451e/FLAG4bac39abd [2025-04-14 00:18:29,373 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:18:29,373 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_91-arrayloop2_racefree.i [2025-04-14 00:18:29,397 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecc18ef4/fdf16226ff7247539e6ff632837b451e/FLAG4bac39abd [2025-04-14 00:18:30,283 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eecc18ef4/fdf16226ff7247539e6ff632837b451e [2025-04-14 00:18:30,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:18:30,286 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:18:30,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:30,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:18:30,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:18:30,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b0a709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30, skipping insertion in model container [2025-04-14 00:18:30,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:18:30,703 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_91-arrayloop2_racefree.i[47038,47051] [2025-04-14 00:18:30,718 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,718 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,718 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,719 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:30,772 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:18:30,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_91-arrayloop2_racefree.i[47038,47051] [2025-04-14 00:18:30,840 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,840 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,840 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,841 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 00:18:30,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:18:30,892 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:18:30,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30 WrapperNode [2025-04-14 00:18:30,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:18:30,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:30,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:18:30,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:18:30,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,936 INFO L138 Inliner]: procedures = 279, calls = 119, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-04-14 00:18:30,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:18:30,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:18:30,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:18:30,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:18:30,945 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,965 INFO L175 MemorySlicer]: Split 96 memory accesses to 4 slices as follows [2, 5, 87, 2]. 91 percent of accesses are in the largest equivalence class. The 77 initializations are split as follows [2, 5, 70, 0]. The 12 writes are split as follows [0, 0, 11, 1]. [2025-04-14 00:18:30,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,976 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:18:30,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:18:30,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:18:30,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:18:30,988 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (1/1) ... [2025-04-14 00:18:30,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:18:31,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:31,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 00:18:31,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 00:18:31,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:18:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-14 00:18:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:18:31,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:18:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:18:31,039 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:18:31,184 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:18:31,186 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:18:31,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-04-14 00:18:31,472 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-04-14 00:18:31,570 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:18:31,570 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:18:31,570 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:18:32,116 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,132 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,134 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,135 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,136 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,140 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,147 WARN L179 LargeBlockEncoding]: Complex 5:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:18:32,150 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:18:32,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:18:32 BoogieIcfgContainer [2025-04-14 00:18:32,151 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:18:32,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:18:32,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:18:32,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:18:32,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:18:30" (1/3) ... [2025-04-14 00:18:32,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426e6be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:18:32, skipping insertion in model container [2025-04-14 00:18:32,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:18:30" (2/3) ... [2025-04-14 00:18:32,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426e6be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:18:32, skipping insertion in model container [2025-04-14 00:18:32,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:18:32" (3/3) ... [2025-04-14 00:18:32,159 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_91-arrayloop2_racefree.i [2025-04-14 00:18:32,170 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:18:32,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_91-arrayloop2_racefree.i that has 2 procedures, 27 locations, 56 edges, 1 initial locations, 10 loop locations, and 1 error locations. [2025-04-14 00:18:32,171 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:18:32,210 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 00:18:32,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 57 transitions, 121 flow [2025-04-14 00:18:32,263 INFO L116 PetriNetUnfolderBase]: 28/57 cut-off events. [2025-04-14 00:18:32,265 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 00:18:32,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 57 events. 28/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2025-04-14 00:18:32,266 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 57 transitions, 121 flow [2025-04-14 00:18:32,268 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 50 transitions, 104 flow [2025-04-14 00:18:32,274 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:18:32,284 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@593bca5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:18:32,284 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 00:18:32,293 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:18:32,293 INFO L116 PetriNetUnfolderBase]: 2/10 cut-off events. [2025-04-14 00:18:32,293 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:32,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:32,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:18:32,296 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 00:18:32,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:32,300 INFO L85 PathProgramCache]: Analyzing trace with hash 19243228, now seen corresponding path program 1 times [2025-04-14 00:18:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:32,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942160329] [2025-04-14 00:18:32,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:32,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:18:32,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:18:32,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:32,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:32,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:32,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942160329] [2025-04-14 00:18:32,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942160329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:18:32,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:18:32,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:18:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231041314] [2025-04-14 00:18:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:18:32,437 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:18:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:18:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:18:32,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2025-04-14 00:18:32,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 50 transitions, 104 flow. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:32,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:32,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2025-04-14 00:18:32,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:18:32,905 INFO L116 PetriNetUnfolderBase]: 49/112 cut-off events. [2025-04-14 00:18:32,905 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:32,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 112 events. 49/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 36 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 211. Up to 109 conditions per place. [2025-04-14 00:18:32,911 INFO L140 encePairwiseOnDemand]: 37/57 looper letters, 28 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2025-04-14 00:18:32,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 120 flow [2025-04-14 00:18:32,913 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:18:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:18:32,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2025-04-14 00:18:32,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2025-04-14 00:18:32,921 INFO L175 Difference]: Start difference. First operand has 29 places, 50 transitions, 104 flow. Second operand 2 states and 52 transitions. [2025-04-14 00:18:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 120 flow [2025-04-14 00:18:32,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:18:32,929 INFO L231 Difference]: Finished difference. Result has 29 places, 30 transitions, 64 flow [2025-04-14 00:18:32,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=30} [2025-04-14 00:18:32,937 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2025-04-14 00:18:32,937 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 30 transitions, 64 flow [2025-04-14 00:18:32,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:32,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:32,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:18:32,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:18:32,938 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 00:18:32,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 593286007, now seen corresponding path program 1 times [2025-04-14 00:18:32,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:32,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931256478] [2025-04-14 00:18:32,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:32,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:18:32,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:18:32,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:32,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:33,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:33,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:33,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931256478] [2025-04-14 00:18:33,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931256478] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:18:33,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:18:33,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:18:33,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072306565] [2025-04-14 00:18:33,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:18:33,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:18:33,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:33,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:18:33,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:18:33,121 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2025-04-14 00:18:33,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 30 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:33,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:33,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2025-04-14 00:18:33,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:18:33,586 INFO L116 PetriNetUnfolderBase]: 49/113 cut-off events. [2025-04-14 00:18:33,586 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:33,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 113 events. 49/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 36 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 224. Up to 109 conditions per place. [2025-04-14 00:18:33,587 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-14 00:18:33,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 31 transitions, 124 flow [2025-04-14 00:18:33,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:18:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:18:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-14 00:18:33,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2025-04-14 00:18:33,588 INFO L175 Difference]: Start difference. First operand has 29 places, 30 transitions, 64 flow. Second operand 3 states and 36 transitions. [2025-04-14 00:18:33,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 31 transitions, 124 flow [2025-04-14 00:18:33,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:18:33,589 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 76 flow [2025-04-14 00:18:33,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-04-14 00:18:33,590 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2025-04-14 00:18:33,590 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 76 flow [2025-04-14 00:18:33,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:33,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:33,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:18:33,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:18:33,591 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 00:18:33,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:33,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1208742972, now seen corresponding path program 1 times [2025-04-14 00:18:33,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:33,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750038856] [2025-04-14 00:18:33,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:33,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:18:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:18:33,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:33,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:33,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750038856] [2025-04-14 00:18:33,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750038856] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:18:33,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369587350] [2025-04-14 00:18:33,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:18:33,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:18:33,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:33,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:18:33,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 00:18:34,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:18:34,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:18:34,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:18:34,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:34,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 00:18:34,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:18:34,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 50 [2025-04-14 00:18:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:34,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:18:34,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:34,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 336 treesize of output 357 [2025-04-14 00:18:34,761 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:34,762 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 330 treesize of output 351 [2025-04-14 00:18:34,825 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 00:18:34,826 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 324 treesize of output 345 [2025-04-14 00:18:34,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-04-14 00:18:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369587350] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:18:35,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:18:35,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-04-14 00:18:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242182596] [2025-04-14 00:18:35,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:18:35,017 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:18:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:35,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:18:35,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:18:35,017 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2025-04-14 00:18:35,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 76 flow. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:35,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:35,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2025-04-14 00:18:35,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:18:37,193 INFO L116 PetriNetUnfolderBase]: 49/116 cut-off events. [2025-04-14 00:18:37,193 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:18:37,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 116 events. 49/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 36 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 238. Up to 109 conditions per place. [2025-04-14 00:18:37,194 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2025-04-14 00:18:37,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 152 flow [2025-04-14 00:18:37,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:18:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:18:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2025-04-14 00:18:37,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.13742690058479531 [2025-04-14 00:18:37,196 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 76 flow. Second operand 6 states and 47 transitions. [2025-04-14 00:18:37,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 152 flow [2025-04-14 00:18:37,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 148 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-14 00:18:37,197 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 108 flow [2025-04-14 00:18:37,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-04-14 00:18:37,197 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2025-04-14 00:18:37,197 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 108 flow [2025-04-14 00:18:37,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:37,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:37,197 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2025-04-14 00:18:37,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 00:18:37,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:18:37,398 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 00:18:37,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:37,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1719753911, now seen corresponding path program 2 times [2025-04-14 00:18:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:37,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716193270] [2025-04-14 00:18:37,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:18:37,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:37,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-14 00:18:37,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:18:37,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:18:37,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:38,345 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:38,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:38,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716193270] [2025-04-14 00:18:38,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716193270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:18:38,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305976930] [2025-04-14 00:18:38,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:18:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:18:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:38,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:18:38,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 00:18:38,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-14 00:18:38,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:18:38,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 00:18:38,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:38,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 00:18:38,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 00:18:38,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,674 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-04-14 00:18:38,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:38,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,705 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,706 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-04-14 00:18:38,718 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:38,725 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,726 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:38,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:38,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,748 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,749 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:38,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:38,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-04-14 00:18:38,778 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:38,783 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,794 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-04-14 00:18:38,846 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-04-14 00:18:38,858 WARN L181 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,861 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,870 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,871 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-04-14 00:18:38,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:38,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:38,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:38,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:38,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-04-14 00:18:38,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:38,913 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,916 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:38,920 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2025-04-14 00:18:38,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,973 WARN L181 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,983 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 00:18:38,986 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,987 WARN L181 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:38,989 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:38,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2025-04-14 00:18:38,993 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:39,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:39,009 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:39,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:39,017 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:39,020 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:39,021 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:39,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:39,030 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:39,032 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:39,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-04-14 00:18:39,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:39,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:39,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:39,052 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:39,053 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:39,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,069 INFO L325 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2025-04-14 00:18:39,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 99 [2025-04-14 00:18:39,073 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 48 [2025-04-14 00:18:39,077 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:39,078 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:39,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2025-04-14 00:18:39,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2025-04-14 00:18:39,089 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 00:18:39,091 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 00:18:39,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 00:18:39,098 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2025-04-14 00:18:39,101 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-04-14 00:18:39,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:39,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-04-14 00:18:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:39,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 00:18:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305976930] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 00:18:39,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 00:18:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-04-14 00:18:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77678339] [2025-04-14 00:18:39,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 00:18:39,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-14 00:18:39,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:18:39,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-14 00:18:39,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=139, Unknown=0, NotChecked=0, Total=240 [2025-04-14 00:18:39,386 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2025-04-14 00:18:39,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 108 flow. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:39,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:18:39,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2025-04-14 00:18:39,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:18:42,707 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-04-14 00:18:47,567 INFO L116 PetriNetUnfolderBase]: 49/122 cut-off events. [2025-04-14 00:18:47,568 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-14 00:18:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 122 events. 49/122 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 279 event pairs, 36 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 272. Up to 109 conditions per place. [2025-04-14 00:18:47,568 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 27 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2025-04-14 00:18:47,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 220 flow [2025-04-14 00:18:47,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 00:18:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-14 00:18:47,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2025-04-14 00:18:47,571 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.09941520467836257 [2025-04-14 00:18:47,571 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 108 flow. Second operand 12 states and 68 transitions. [2025-04-14 00:18:47,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 220 flow [2025-04-14 00:18:47,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 206 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 00:18:47,572 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 178 flow [2025-04-14 00:18:47,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=178, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-04-14 00:18:47,573 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2025-04-14 00:18:47,573 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 178 flow [2025-04-14 00:18:47,573 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:18:47,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:18:47,575 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2025-04-14 00:18:47,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 00:18:47,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-14 00:18:47,779 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 00:18:47,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:18:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1932476777, now seen corresponding path program 3 times [2025-04-14 00:18:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:18:47,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531855974] [2025-04-14 00:18:47,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:18:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:18:47,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. [2025-04-14 00:18:50,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 00:18:50,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-14 00:18:50,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:18:51,548 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:18:51,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:18:51,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531855974] [2025-04-14 00:18:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531855974] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 00:18:51,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128953186] [2025-04-14 00:18:51,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:18:51,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:18:51,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:18:51,550 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 00:18:51,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 00:18:51,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 6 equivalence classes. Received shutdown request... [2025-04-14 00:33:11,092 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:33:11,102 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 00:33:12,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2025-04-14 00:33:12,306 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forcibly destroying the process [2025-04-14 00:33:12,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 137 [2025-04-14 00:33:12,362 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 00:33:12,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 00:33:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-04-14 00:33:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267948959] [2025-04-14 00:33:12,362 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 00:33:12,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 00:33:12,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:33:12,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 00:33:12,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 00:33:12,363 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 57 [2025-04-14 00:33:12,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 178 flow. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:33:12,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:33:12,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 57 [2025-04-14 00:33:12,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:33:12,364 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 00:33:12,365 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:33:12,365 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 00:33:12,366 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 00:33:12,366 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-14 00:33:12,366 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-14 00:33:12,369 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:33:12,369 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:33:12,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:33:12 BasicIcfg [2025-04-14 00:33:12,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:33:12,373 INFO L158 Benchmark]: Toolchain (without parser) took 882086.26ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 98.3MB in the beginning and 609.5MB in the end (delta: -511.2MB). Peak memory consumption was 444.9MB. Max. memory is 8.0GB. [2025-04-14 00:33:12,373 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:33:12,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 604.27ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 63.3MB in the end (delta: 35.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:33:12,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 59.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:33:12,374 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 56.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:33:12,374 INFO L158 Benchmark]: IcfgBuilder took 1166.60ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 51.3MB in the end (delta: 4.5MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. [2025-04-14 00:33:12,375 INFO L158 Benchmark]: TraceAbstraction took 880218.25ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 50.1MB in the beginning and 609.5MB in the end (delta: -559.3MB). Peak memory consumption was 395.4MB. Max. memory is 8.0GB. [2025-04-14 00:33:12,376 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.18ms. Allocated memory is still 167.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 604.27ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 63.3MB in the end (delta: 35.0MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.59ms. Allocated memory is still 142.6MB. Free memory was 63.3MB in the beginning and 59.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 56.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1166.60ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 51.3MB in the end (delta: 4.5MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. * TraceAbstraction took 880218.25ms. Allocated memory was 142.6MB in the beginning and 1.1GB in the end (delta: 956.3MB). Free memory was 50.1MB in the beginning and 609.5MB in the end (delta: -559.3MB). Peak memory consumption was 395.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 999]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 48 locations, 100 edges, 3 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: 880.1s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 342 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 0 mSDtfsCounter, 342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=4, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 60 ConstructedInterpolants, 3 QuantifiedInterpolants, 313 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1032 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 0/88 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown