/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/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 15:29:49,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 15:29:49,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 15:29:49,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 15:29:49,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 15:29:49,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 15:29:49,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 15:29:49,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 15:29:49,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 15:29:49,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 15:29:49,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 15:29:49,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 15:29:49,951 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:29:49,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:29:49,951 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:29:49,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 15:29:49,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 15:29:49,952 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 15:29:49,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 15:29:50,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 15:29:50,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 15:29:50,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 15:29:50,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 15:29:50,178 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 15:29:50,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-04-14 15:29:51,488 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da7342a8/b00900cdfbd44affa4cfb30a81a49e0b/FLAGfd9e8ef2c [2025-04-14 15:29:51,771 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 15:29:51,772 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2025-04-14 15:29:51,783 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da7342a8/b00900cdfbd44affa4cfb30a81a49e0b/FLAGfd9e8ef2c [2025-04-14 15:29:52,489 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da7342a8/b00900cdfbd44affa4cfb30a81a49e0b [2025-04-14 15:29:52,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 15:29:52,492 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 15:29:52,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 15:29:52,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 15:29:52,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 15:29:52,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:52,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41746ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52, skipping insertion in model container [2025-04-14 15:29:52,497 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:52,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 15:29:52,795 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_90-arrayloop2_racing.i[47038,47051] [2025-04-14 15:29:52,808 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,808 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,808 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,808 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:29:52,876 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 15:29:52,937 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_90-arrayloop2_racing.i[47038,47051] [2025-04-14 15:29:52,942 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,942 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,942 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,942 WARN L1730 CHandler]: Possible shadowing of function new [2025-04-14 15:29:52,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:29:52,993 INFO L204 MainTranslator]: Completed translation [2025-04-14 15:29:52,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52 WrapperNode [2025-04-14 15:29:52,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 15:29:52,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 15:29:52,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 15:29:52,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 15:29:52,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,018 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,046 INFO L138 Inliner]: procedures = 280, calls = 142, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 354 [2025-04-14 15:29:53,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 15:29:53,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 15:29:53,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 15:29:53,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 15:29:53,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 15:29:53,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 15:29:53,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 15:29:53,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 15:29:53,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (1/1) ... [2025-04-14 15:29:53,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:29:53,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:29:53,139 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 15:29:53,144 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 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-04-14 15:29:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-14 15:29:53,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 15:29:53,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 15:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 15:29:53,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 15:29:53,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 15:29:53,161 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 15:29:53,291 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 15:29:53,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 15:29:53,784 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-04-14 15:29:53,785 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-04-14 15:29:53,785 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-2: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-04-14 15:29:53,785 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-3: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-04-14 15:29:53,786 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 15:29:53,786 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 15:29:54,235 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 15:29:54,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 15:29:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:29:54 BoogieIcfgContainer [2025-04-14 15:29:54,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 15:29:54,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 15:29:54,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 15:29:54,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 15:29:54,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:29:52" (1/3) ... [2025-04-14 15:29:54,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55caa01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:29:54, skipping insertion in model container [2025-04-14 15:29:54,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:29:52" (2/3) ... [2025-04-14 15:29:54,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55caa01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:29:54, skipping insertion in model container [2025-04-14 15:29:54,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:29:54" (3/3) ... [2025-04-14 15:29:54,243 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2025-04-14 15:29:54,256 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 15:29:54,258 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_90-arrayloop2_racing.i that has 3 procedures, 80 locations, 111 edges, 1 initial locations, 18 loop locations, and 2 error locations. [2025-04-14 15:29:54,258 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 15:29:54,343 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 15:29:54,377 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:29:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 15:29:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:29:54,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 15:29:54,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 15:29:54,466 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:29:54,478 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2_funThread1of1ForFork1 ======== [2025-04-14 15:29:54,483 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=PARTIAL_ORDER_FA, 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;@ed0d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:29:54,483 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 15:29:56,362 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:29:56,362 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:29:56,362 INFO L139 ounterexampleChecker]: Examining path program with hash -1163743565, occurence #1 [2025-04-14 15:29:56,362 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:29:56,362 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:29:56,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 479268597, now seen corresponding path program 1 times [2025-04-14 15:29:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:29:56,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23321265] [2025-04-14 15:29:56,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:56,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:56,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 15:29:56,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 15:29:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:56,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:56,737 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 15:29:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:29:56,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23321265] [2025-04-14 15:29:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23321265] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:29:56,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:29:56,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 15:29:56,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018504079] [2025-04-14 15:29:56,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:29:56,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:29:56,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:29:56,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:29:56,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:29:56,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:56,765 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:29:56,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 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 15:29:56,766 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:57,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:57,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 15:29:57,697 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:29:57,697 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:29:57,697 INFO L139 ounterexampleChecker]: Examining path program with hash 1790107924, occurence #1 [2025-04-14 15:29:57,697 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:29:57,697 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:29:57,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1309873066, now seen corresponding path program 1 times [2025-04-14 15:29:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:29:57,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649127836] [2025-04-14 15:29:57,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:57,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-04-14 15:29:57,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-04-14 15:29:57,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:57,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:57,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:29:57,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649127836] [2025-04-14 15:29:57,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649127836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:29:57,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:29:57,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:29:57,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297309471] [2025-04-14 15:29:57,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:29:57,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:29:57,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:29:57,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:29:57,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:29:57,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:57,905 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:29:57,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 15:29:57,905 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:57,905 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:58,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:58,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:58,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 15:29:58,057 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:29:58,057 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:29:58,057 INFO L139 ounterexampleChecker]: Examining path program with hash 1790107924, occurence #2 [2025-04-14 15:29:58,057 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:29:58,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:29:58,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 15:29:58,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 15:29:58,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 15:29:58,058 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 15:29:58,059 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 36 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 54 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 60 [2025-04-14 15:29:58,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 15:29:58,094 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_17 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 15:29:58,094 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 15:29:58,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash 2026354586, now seen corresponding path program 1 times [2025-04-14 15:29:58,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 15:29:58,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192456797] [2025-04-14 15:29:58,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 15:29:58,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 15:29:58,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:58,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:58,278 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 15:29:58,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192456797] [2025-04-14 15:29:58,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192456797] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:58,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [29151354] [2025-04-14 15:29:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:58,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 15:29:58,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 15:29:58,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:58,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:58,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:29:58,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:29:58,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:58,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [29151354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:58,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:29:58,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 15:29:58,367 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 15:29:58,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 66 [2025-04-14 15:29:58,367 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-04-14 15:29:58,367 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 68 [2025-04-14 15:29:58,367 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 90 [2025-04-14 15:29:58,367 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,367 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 91 [2025-04-14 15:29:58,368 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 92 [2025-04-14 15:29:58,368 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,368 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 99 [2025-04-14 15:29:58,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1391413337, now seen corresponding path program 1 times [2025-04-14 15:29:58,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 15:29:58,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686689273] [2025-04-14 15:29:58,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:58,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-14 15:29:58,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-14 15:29:58,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:58,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:58,591 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 15:29:58,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686689273] [2025-04-14 15:29:58,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686689273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:58,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1456040358] [2025-04-14 15:29:58,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:58,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-14 15:29:58,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-14 15:29:58,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:58,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:58,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:29:58,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:29:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:58,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1456040358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:58,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:29:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2025-04-14 15:29:58,708 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 15:29:58,710 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 103 [2025-04-14 15:29:58,710 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,710 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 104 [2025-04-14 15:29:58,710 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,710 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 105 [2025-04-14 15:29:58,710 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:58,710 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:29:58,710 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:29:58,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1816803051, now seen corresponding path program 1 times [2025-04-14 15:29:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:29:58,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514384984] [2025-04-14 15:29:58,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:58,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 15:29:58,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 15:29:58,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:58,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:29:58,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514384984] [2025-04-14 15:29:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514384984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:58,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949352402] [2025-04-14 15:29:58,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:58,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:29:58,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:29:58,857 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 15:29:58,858 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 15:29:58,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-14 15:29:59,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-14 15:29:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:59,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 860 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:29:59,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:29:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:59,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:29:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:29:59,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949352402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:29:59,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:29:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 15:29:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141044105] [2025-04-14 15:29:59,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:29:59,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 15:29:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:29:59,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 15:29:59,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 15:29:59,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:59,100 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:29:59,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 15:29:59,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:59,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:59,100 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:29:59,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:59,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:29:59,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:29:59,513 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 15:29:59,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2025-04-14 15:29:59,703 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:29:59,703 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:29:59,703 INFO L139 ounterexampleChecker]: Examining path program with hash 1790107924, occurence #3 [2025-04-14 15:29:59,703 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 15:29:59,704 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 18 [2025-04-14 15:29:59,704 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 38 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 56 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2025-04-14 15:29:59,704 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:29:59,704 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-14 15:29:59,747 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_22 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 15:29:59,747 WARN L330 ript$VariableManager]: TermVariable v_DerPreprocessor_21 not constructed by VariableManager. Cannot ensure absence of name clashes. [2025-04-14 15:29:59,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:29:59,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1735413025, now seen corresponding path program 1 times [2025-04-14 15:29:59,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 15:29:59,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662739445] [2025-04-14 15:29:59,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:59,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:59,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-14 15:29:59,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-14 15:29:59,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:29:59,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:29:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 15:29:59,945 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 15:29:59,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662739445] [2025-04-14 15:29:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662739445] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:29:59,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [1558762150] [2025-04-14 15:29:59,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:29:59,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:29:59,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-14 15:30:00,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-14 15:30:00,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:00,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:00,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:30:00,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:30:00,068 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 15:30:00,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [1558762150] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:00,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:30:00,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 15:30:00,068 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 15:30:00,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 69 [2025-04-14 15:30:00,068 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,068 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 70 [2025-04-14 15:30:00,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 71 [2025-04-14 15:30:00,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 93 [2025-04-14 15:30:00,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 94 [2025-04-14 15:30:00,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 95 [2025-04-14 15:30:00,069 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,069 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 102 [2025-04-14 15:30:00,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1601296434, now seen corresponding path program 1 times [2025-04-14 15:30:00,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 15:30:00,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129919518] [2025-04-14 15:30:00,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:00,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-14 15:30:00,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-14 15:30:00,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:00,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 15:30:00,271 INFO L136 FreeRefinementEngine]: Strategy SMTINTERPOL found an infeasible trace [2025-04-14 15:30:00,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129919518] [2025-04-14 15:30:00,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129919518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:00,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolSpWp [307386969] [2025-04-14 15:30:00,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:00,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-14 15:30:00,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-14 15:30:00,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:00,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:00,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:30:00,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:30:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 15:30:00,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolSpWp [307386969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:00,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 15:30:00,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2025-04-14 15:30:00,407 INFO L195 ounterexampleChecker]: Commutativity condition check failed due to imperfect proof (attempt 1 of 1). [2025-04-14 15:30:00,407 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 106 [2025-04-14 15:30:00,407 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,407 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 107 [2025-04-14 15:30:00,407 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,407 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 108 [2025-04-14 15:30:00,407 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:00,407 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:30:00,407 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:00,407 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:00,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1268622358, now seen corresponding path program 2 times [2025-04-14 15:30:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:00,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815641145] [2025-04-14 15:30:00,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:30:00,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:00,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-04-14 15:30:00,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 106 of 112 statements. [2025-04-14 15:30:00,462 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 15:30:00,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-14 15:30:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:00,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815641145] [2025-04-14 15:30:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815641145] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:30:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:30:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 15:30:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051530784] [2025-04-14 15:30:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:30:00,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 15:30:00,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:30:00,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 15:30:00,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 15:30:00,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:00,525 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:30:00,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 15:30:00,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:00,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:00,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:30:00,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,351 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:30:01,352 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 15:30:01,354 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 15:30:01,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable9 [2025-04-14 15:30:01,358 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-14 15:30:01,359 INFO L320 ceAbstractionStarter]: Result for error location t2_funThread1of1ForFork1 was SAFE (1/3) [2025-04-14 15:30:01,362 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:30:01,362 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:30:01,362 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1_funThread1of1ForFork0 ======== [2025-04-14 15:30:01,363 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=PARTIAL_ORDER_FA, 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;@ed0d12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:30:01,363 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 15:30:01,371 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:30:01,371 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:30:01,371 INFO L139 ounterexampleChecker]: Examining path program with hash 293889848, occurence #1 [2025-04-14 15:30:01,371 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:30:01,371 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:01,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1391701820, now seen corresponding path program 1 times [2025-04-14 15:30:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:01,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742163363] [2025-04-14 15:30:01,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:01,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 15:30:01,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 15:30:01,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:01,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:01,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:01,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742163363] [2025-04-14 15:30:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742163363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:30:01,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:30:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 15:30:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002820105] [2025-04-14 15:30:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:30:01,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:30:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:30:01,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:30:01,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:30:01,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,409 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:30:01,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 15:30:01,409 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 15:30:01,477 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:30:01,477 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:30:01,477 INFO L139 ounterexampleChecker]: Examining path program with hash 1805085990, occurence #1 [2025-04-14 15:30:01,477 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:30:01,477 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:01,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:01,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1900821207, now seen corresponding path program 1 times [2025-04-14 15:30:01,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:01,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254319563] [2025-04-14 15:30:01,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:01,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:01,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 15:30:01,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 15:30:01,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:01,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:01,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254319563] [2025-04-14 15:30:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254319563] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:30:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:30:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:30:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909332321] [2025-04-14 15:30:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:30:01,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:30:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:30:01,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:30:01,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:30:01,522 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,522 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:30:01,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 15:30:01,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,523 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 15:30:01,632 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:30:01,632 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:30:01,632 INFO L139 ounterexampleChecker]: Examining path program with hash 1805085990, occurence #2 [2025-04-14 15:30:01,632 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:30:01,632 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:30:01,632 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:01,632 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 15:30:01,632 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:01,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 15:30:01,633 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:01,633 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 15:30:01,633 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:30:01,633 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:30:01,633 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:01,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash -790895766, now seen corresponding path program 1 times [2025-04-14 15:30:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:01,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910571502] [2025-04-14 15:30:01,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:01,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:01,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 15:30:01,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 15:30:01,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:01,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:01,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910571502] [2025-04-14 15:30:01,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910571502] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:01,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148731549] [2025-04-14 15:30:01,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:30:01,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:30:01,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:30:01,711 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 15:30:01,713 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 15:30:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 15:30:01,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 15:30:01,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:30:01,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:01,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 15:30:01,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:30:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:01,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:30:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:01,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148731549] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:30:01,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:30:01,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 15:30:01,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392700938] [2025-04-14 15:30:01,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:30:01,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 15:30:01,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:30:01,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 15:30:01,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 15:30:01,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:01,949 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:30:01,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 15:30:01,949 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,950 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:01,950 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:02,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:02,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:02,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:30:02,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 15:30:02,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:30:02,637 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:30:02,637 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:30:02,637 INFO L139 ounterexampleChecker]: Examining path program with hash 1805085990, occurence #3 [2025-04-14 15:30:02,637 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:30:02,637 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:30:02,637 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:02,637 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 15:30:02,637 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:02,637 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 15:30:02,637 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:02,637 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 15:30:02,637 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:30:02,637 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:30:02,637 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:02,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:02,638 INFO L85 PathProgramCache]: Analyzing trace with hash -420885143, now seen corresponding path program 2 times [2025-04-14 15:30:02,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:02,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232023746] [2025-04-14 15:30:02,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:30:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:02,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 15:30:02,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 15:30:02,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:30:02,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-14 15:30:02,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:02,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232023746] [2025-04-14 15:30:02,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232023746] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:02,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995536543] [2025-04-14 15:30:02,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:30:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:30:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:30:02,752 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 15:30:02,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 15:30:02,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 15:30:03,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 15:30:03,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:30:03,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:03,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 15:30:03,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 15:30:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:03,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 15:30:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:30:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995536543] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 15:30:03,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 15:30:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-04-14 15:30:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37490855] [2025-04-14 15:30:03,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 15:30:03,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 15:30:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:30:03,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 15:30:03,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-04-14 15:30:03,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:03,093 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:30:03,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 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 15:30:03,093 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:03,093 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:03,093 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:30:03,093 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:30:03,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:03,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:30:03,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:30:03,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 15:30:03,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 15:30:04,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 15:30:04,150 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 15:30:04,150 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:30:04,150 INFO L139 ounterexampleChecker]: Examining path program with hash 1805085990, occurence #4 [2025-04-14 15:30:04,150 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 15:30:04,150 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 15:30:04,150 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 15:30:04,150 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 15:30:04,150 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 15:30:04,150 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 15:30:04,150 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 15:30:04,150 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 15:30:04,151 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 15:30:04,151 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:30:04,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:30:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash 846766294, now seen corresponding path program 3 times [2025-04-14 15:30:04,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:30:04,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52213195] [2025-04-14 15:30:04,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:30:04,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:30:04,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 13 equivalence classes. [2025-04-14 15:30:15,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 42 of 42 statements. [2025-04-14 15:30:15,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-04-14 15:30:15,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:30:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-14 15:30:15,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:30:15,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52213195] [2025-04-14 15:30:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52213195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 15:30:15,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723486738] [2025-04-14 15:30:15,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:30:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 15:30:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:30:15,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 15:30:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 15:30:16,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 13 equivalence classes. Received shutdown request... [2025-04-14 15:44:28,653 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 15:44:28,658 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 15:44:28,677 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 15:44:29,668 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 15:44:29,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 15:44:29,853 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-14 15:44:29,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-14 15:44:29,908 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 15:44:29,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-14 15:44:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-04-14 15:44:29,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867166543] [2025-04-14 15:44:29,908 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-14 15:44:29,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 15:44:29,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:44:29,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 15:44:29,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 15:44:29,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:44:29,909 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:44:29,909 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 15:44:29,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:44:29,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:44:29,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 15:44:29,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-14 15:44:29,909 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:44:29,910 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 15:44:29,910 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-14 15:44:29,910 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 15:44:29,911 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2025-04-14 15:44:29,912 INFO L320 ceAbstractionStarter]: Result for error location t1_funThread1of1ForFork0 was TIMEOUT (2/3) [2025-04-14 15:44:29,913 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 15:44:29,913 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 15:44:29,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:44:29 BasicIcfg [2025-04-14 15:44:29,915 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 15:44:29,916 INFO L158 Benchmark]: Toolchain (without parser) took 877423.78ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 108.1MB in the beginning and 604.5MB in the end (delta: -496.4MB). Peak memory consumption was 791.9MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,916 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:44:29,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.19ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 71.8MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,916 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.56ms. Allocated memory is still 155.2MB. Free memory was 71.8MB in the beginning and 67.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,916 INFO L158 Benchmark]: Boogie Preprocessor took 55.60ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 65.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,917 INFO L158 Benchmark]: IcfgBuilder took 1128.59ms. Allocated memory is still 155.2MB. Free memory was 65.0MB in the beginning and 41.0MB in the end (delta: 24.0MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,917 INFO L158 Benchmark]: TraceAbstraction took 875678.13ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 41.0MB in the beginning and 604.5MB in the end (delta: -563.5MB). Peak memory consumption was 723.1MB. Max. memory is 8.0GB. [2025-04-14 15:44:29,917 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.17ms. Allocated memory is still 155.2MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.19ms. Allocated memory is still 155.2MB. Free memory was 108.1MB in the beginning and 71.8MB in the end (delta: 36.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.56ms. Allocated memory is still 155.2MB. Free memory was 71.8MB in the beginning and 67.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.60ms. Allocated memory is still 155.2MB. Free memory was 67.6MB in the beginning and 65.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1128.59ms. Allocated memory is still 155.2MB. Free memory was 65.0MB in the beginning and 41.0MB in the end (delta: 24.0MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. * TraceAbstraction took 875678.13ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 41.0MB in the beginning and 604.5MB in the end (delta: -563.5MB). Peak memory consumption was 723.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10569, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 982, dependent conditional: 883, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9730, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 143, dependent conditional: 44, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9730, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 143, dependent conditional: 44, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 183, dependent conditional: 84, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 0, independent unconditional: 9587, dependent: 183, dependent conditional: 6, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 0, independent unconditional: 9587, dependent: 183, dependent conditional: 6, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4947, independent: 4842, independent conditional: 0, independent unconditional: 4842, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4947, independent: 4795, independent conditional: 0, independent unconditional: 4795, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 152, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 152, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3063, independent: 685, independent conditional: 0, independent unconditional: 685, dependent: 2378, dependent conditional: 269, dependent unconditional: 2109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 9770, independent: 4745, independent conditional: 0, independent unconditional: 4745, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 4947, unknown conditional: 6, unknown unconditional: 4941] , Statistics on independence cache: Total cache size (in pairs): 4951, Positive cache size: 4846, Positive conditional cache size: 4, Positive unconditional cache size: 4842, Negative cache size: 105, Negative conditional cache size: 6, Negative unconditional cache size: 99, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 1, Independence queries for same thread: 839, Persistent sets #1 benchmarks: Persistent set computation time: 2.9s, Number of persistent set computation: 235, Number of trivial persistent sets: 208, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8393, independent: 8294, independent conditional: 0, independent unconditional: 8294, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10569, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 982, dependent conditional: 883, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9730, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 143, dependent conditional: 44, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9730, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 143, dependent conditional: 44, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 1293, independent unconditional: 8294, dependent: 183, dependent conditional: 84, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 0, independent unconditional: 9587, dependent: 183, dependent conditional: 6, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9770, independent: 9587, independent conditional: 0, independent unconditional: 9587, dependent: 183, dependent conditional: 6, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4947, independent: 4842, independent conditional: 0, independent unconditional: 4842, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4947, independent: 4795, independent conditional: 0, independent unconditional: 4795, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 152, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 152, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 105, dependent conditional: 6, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3063, independent: 685, independent conditional: 0, independent unconditional: 685, dependent: 2378, dependent conditional: 269, dependent unconditional: 2109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 4, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 9770, independent: 4745, independent conditional: 0, independent unconditional: 4745, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 4947, unknown conditional: 6, unknown unconditional: 4941] , Statistics on independence cache: Total cache size (in pairs): 4951, Positive cache size: 4846, Positive conditional cache size: 4, Positive unconditional cache size: 4842, Negative cache size: 105, Negative conditional cache size: 6, Negative unconditional cache size: 99, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1371, Maximal queried relation: 1, Independence queries for same thread: 839 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1020, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 167, dependent conditional: 158, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 871, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4941, Positive cache size: 4842, Positive conditional cache size: 0, Positive unconditional cache size: 4842, Negative cache size: 99, Negative conditional cache size: 0, Negative unconditional cache size: 99, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 1, Independence queries for same thread: 153, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 32, Number of trivial persistent sets: 31, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 779, independent: 770, independent conditional: 0, independent unconditional: 770, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1020, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 167, dependent conditional: 158, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 867, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 867, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 14, dependent conditional: 5, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 871, independent: 853, independent conditional: 83, independent unconditional: 770, dependent: 18, dependent conditional: 9, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 871, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 4941, Positive cache size: 4842, Positive conditional cache size: 0, Positive unconditional cache size: 4842, Negative cache size: 99, Negative conditional cache size: 0, Negative unconditional cache size: 99, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 92, Maximal queried relation: 1, Independence queries for same thread: 153 - PositiveResult [Line: 999]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - 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 for errors in thread instance: t2_funThread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 146 locations, 209 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 4.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 501 NumberOfCodeBlocks, 495 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 604 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 860 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 15/18 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 1350, ConditionCalculationTime [ms]: 150, ConditionCalculations: 40, QuantifiedConditions: 0, TraceChecks: 4, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 4 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1_funThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 146 locations, 209 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 868.6s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 39, 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, 11.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1153 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 126/274 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 11, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown