/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:50:55,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:55,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:50:55,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:55,942 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:55,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:55,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:55,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:55,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:55,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:55,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:55,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:55,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:55,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:55,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:55,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:55,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:55,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:55,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:55,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:55,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:55,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:55,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:50:56,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:56,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:56,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:56,206 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:56,206 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:56,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2025-04-13 21:50:57,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926d20ca8/3cd2b34b497e4adf8ad1e2e2b905e862/FLAG299c9a62c [2025-04-13 21:50:57,823 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:50:57,823 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2025-04-13 21:50:57,854 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926d20ca8/3cd2b34b497e4adf8ad1e2e2b905e862/FLAG299c9a62c [2025-04-13 21:50:58,496 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/926d20ca8/3cd2b34b497e4adf8ad1e2e2b905e862 [2025-04-13 21:50:58,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:50:58,499 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:50:58,500 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:58,500 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:50:58,503 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:50:58,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:58" (1/1) ... [2025-04-13 21:50:58,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a050b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:58, skipping insertion in model container [2025-04-13 21:50:58,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:50:58" (1/1) ... [2025-04-13 21:50:58,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:50:58,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300] [2025-04-13 21:50:58,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:58,941 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:50:58,984 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[186287,186300] [2025-04-13 21:50:59,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:50:59,039 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:50:59,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59 WrapperNode [2025-04-13 21:50:59,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:50:59,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:59,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:50:59,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:50:59,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,093 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-04-13 21:50:59,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:50:59,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:50:59,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:50:59,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:50:59,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,126 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2025-04-13 21:50:59,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:50:59,150 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:50:59,150 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:50:59,150 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:50:59,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (1/1) ... [2025-04-13 21:50:59,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:50:59,179 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-13 21:50:59,182 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-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-13 21:50:59,200 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:50:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:50:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:50:59,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:50:59,202 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:50:59,419 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:50:59,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:50:59,646 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:50:59,648 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:50:59,648 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:50:59,849 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:50:59,878 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:50:59,917 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:50:59,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:59 BoogieIcfgContainer [2025-04-13 21:50:59,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:50:59,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:50:59,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:50:59,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:50:59,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:50:58" (1/3) ... [2025-04-13 21:50:59,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7934310a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:59, skipping insertion in model container [2025-04-13 21:50:59,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:50:59" (2/3) ... [2025-04-13 21:50:59,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7934310a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:50:59, skipping insertion in model container [2025-04-13 21:50:59,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:50:59" (3/3) ... [2025-04-13 21:50:59,924 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2025-04-13 21:50:59,934 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:50:59,935 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_5-container_of.i that has 2 procedures, 29 locations, 34 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-13 21:50:59,935 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:50:59,987 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:51:00,011 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 44 transitions, 102 flow [2025-04-13 21:51:00,049 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 503 states, 493 states have (on average 2.4827586206896552) internal successors, (1224), 502 states have internal predecessors, (1224), 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-13 21:51:00,070 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:51:00,080 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=FINITE_AUTOMATA, 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;@31e0dec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:51:00,081 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 21:51:00,083 INFO L278 IsEmpty]: Start isEmpty. Operand has 503 states, 493 states have (on average 2.4827586206896552) internal successors, (1224), 502 states have internal predecessors, (1224), 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-13 21:51:00,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 21:51:00,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:00,088 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 21:51:00,088 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:00,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 435, now seen corresponding path program 1 times [2025-04-13 21:51:00,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:00,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110783579] [2025-04-13 21:51:00,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:00,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 21:51:00,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 21:51:00,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:00,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:00,586 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-13 21:51:00,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:00,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110783579] [2025-04-13 21:51:00,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110783579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:00,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:00,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 21:51:00,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598182861] [2025-04-13 21:51:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:00,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:51:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:00,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:51:00,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:00,607 INFO L87 Difference]: Start difference. First operand has 503 states, 493 states have (on average 2.4827586206896552) internal successors, (1224), 502 states have internal predecessors, (1224), 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) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-13 21:51:00,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:00,709 INFO L93 Difference]: Finished difference Result 503 states and 1224 transitions. [2025-04-13 21:51:00,710 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:51:00,711 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1 [2025-04-13 21:51:00,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:00,719 INFO L225 Difference]: With dead ends: 503 [2025-04-13 21:51:00,719 INFO L226 Difference]: Without dead ends: 257 [2025-04-13 21:51:00,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:00,727 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:00,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-13 21:51:00,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2025-04-13 21:51:00,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 253 states have (on average 2.150197628458498) internal successors, (544), 256 states have internal predecessors, (544), 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-13 21:51:00,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 544 transitions. [2025-04-13 21:51:00,764 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 544 transitions. Word has length 1 [2025-04-13 21:51:00,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:00,765 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 544 transitions. [2025-04-13 21:51:00,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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-13 21:51:00,765 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 544 transitions. [2025-04-13 21:51:00,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 21:51:00,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:00,766 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:00,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:51:00,766 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:00,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:00,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1488983079, now seen corresponding path program 1 times [2025-04-13 21:51:00,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:00,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073224384] [2025-04-13 21:51:00,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:00,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:51:00,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:51:00,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:00,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:01,122 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-13 21:51:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:01,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073224384] [2025-04-13 21:51:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073224384] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:01,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:01,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:51:01,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31883855] [2025-04-13 21:51:01,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:01,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:51:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:01,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:51:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:01,124 INFO L87 Difference]: Start difference. First operand 257 states and 544 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-13 21:51:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:01,211 INFO L93 Difference]: Finished difference Result 288 states and 596 transitions. [2025-04-13 21:51:01,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:51:01,211 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2025-04-13 21:51:01,211 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:01,213 INFO L225 Difference]: With dead ends: 288 [2025-04-13 21:51:01,213 INFO L226 Difference]: Without dead ends: 279 [2025-04-13 21:51:01,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:01,214 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:01,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-13 21:51:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2025-04-13 21:51:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 259 states have (on average 2.138996138996139) internal successors, (554), 262 states have internal predecessors, (554), 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-13 21:51:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 554 transitions. [2025-04-13 21:51:01,228 INFO L79 Accepts]: Start accepts. Automaton has 263 states and 554 transitions. Word has length 18 [2025-04-13 21:51:01,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:01,228 INFO L485 AbstractCegarLoop]: Abstraction has 263 states and 554 transitions. [2025-04-13 21:51:01,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-13 21:51:01,228 INFO L278 IsEmpty]: Start isEmpty. Operand 263 states and 554 transitions. [2025-04-13 21:51:01,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:01,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:01,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:01,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:51:01,229 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:01,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1086165236, now seen corresponding path program 1 times [2025-04-13 21:51:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:01,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559171987] [2025-04-13 21:51:01,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:01,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:01,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:01,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:01,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:01,429 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-13 21:51:01,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:01,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559171987] [2025-04-13 21:51:01,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559171987] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:01,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:01,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:51:01,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819256707] [2025-04-13 21:51:01,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:01,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:51:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:01,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:51:01,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:01,431 INFO L87 Difference]: Start difference. First operand 263 states and 554 transitions. Second operand has 3 states, 2 states have (on average 9.5) 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-13 21:51:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:01,504 INFO L93 Difference]: Finished difference Result 289 states and 597 transitions. [2025-04-13 21:51:01,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:51:01,505 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) 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) Word has length 19 [2025-04-13 21:51:01,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:01,507 INFO L225 Difference]: With dead ends: 289 [2025-04-13 21:51:01,507 INFO L226 Difference]: Without dead ends: 280 [2025-04-13 21:51:01,507 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:51:01,508 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:01,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-04-13 21:51:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 269. [2025-04-13 21:51:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 265 states have (on average 2.147169811320755) internal successors, (569), 268 states have internal predecessors, (569), 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-13 21:51:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 569 transitions. [2025-04-13 21:51:01,525 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 569 transitions. Word has length 19 [2025-04-13 21:51:01,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:01,525 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 569 transitions. [2025-04-13 21:51:01,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) 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-13 21:51:01,525 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 569 transitions. [2025-04-13 21:51:01,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:51:01,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:01,526 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:01,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:51:01,528 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:01,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:01,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1390331169, now seen corresponding path program 1 times [2025-04-13 21:51:01,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:01,529 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803369924] [2025-04-13 21:51:01,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:01,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:01,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:51:01,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:51:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:02,281 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-13 21:51:02,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:02,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803369924] [2025-04-13 21:51:02,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803369924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:02,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:02,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302652909] [2025-04-13 21:51:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:02,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 21:51:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:02,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 21:51:02,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:51:02,283 INFO L87 Difference]: Start difference. First operand 269 states and 569 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-13 21:51:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:02,650 INFO L93 Difference]: Finished difference Result 520 states and 1090 transitions. [2025-04-13 21:51:02,650 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:51:02,651 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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) Word has length 22 [2025-04-13 21:51:02,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:02,654 INFO L225 Difference]: With dead ends: 520 [2025-04-13 21:51:02,654 INFO L226 Difference]: Without dead ends: 347 [2025-04-13 21:51:02,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2025-04-13 21:51:02,656 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 159 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:02,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 26 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-04-13 21:51:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 279. [2025-04-13 21:51:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 2.1236363636363635) internal successors, (584), 278 states have internal predecessors, (584), 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-13 21:51:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 584 transitions. [2025-04-13 21:51:02,673 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 584 transitions. Word has length 22 [2025-04-13 21:51:02,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:02,674 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 584 transitions. [2025-04-13 21:51:02,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-13 21:51:02,674 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 584 transitions. [2025-04-13 21:51:02,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:51:02,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:02,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:02,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:51:02,675 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:02,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:02,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1083584095, now seen corresponding path program 2 times [2025-04-13 21:51:02,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:02,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85419894] [2025-04-13 21:51:02,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:02,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:51:02,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:51:02,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:02,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:03,110 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-13 21:51:03,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:03,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85419894] [2025-04-13 21:51:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85419894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:03,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:03,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774652044] [2025-04-13 21:51:03,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:03,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:51:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:03,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:51:03,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:51:03,112 INFO L87 Difference]: Start difference. First operand 279 states and 584 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-13 21:51:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:03,413 INFO L93 Difference]: Finished difference Result 611 states and 1256 transitions. [2025-04-13 21:51:03,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:03,413 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) Word has length 22 [2025-04-13 21:51:03,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:03,415 INFO L225 Difference]: With dead ends: 611 [2025-04-13 21:51:03,416 INFO L226 Difference]: Without dead ends: 438 [2025-04-13 21:51:03,416 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2025-04-13 21:51:03,417 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 187 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:03,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 23 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:03,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-04-13 21:51:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 291. [2025-04-13 21:51:03,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 287 states have (on average 2.1045296167247387) internal successors, (604), 290 states have internal predecessors, (604), 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-13 21:51:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 604 transitions. [2025-04-13 21:51:03,424 INFO L79 Accepts]: Start accepts. Automaton has 291 states and 604 transitions. Word has length 22 [2025-04-13 21:51:03,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:03,424 INFO L485 AbstractCegarLoop]: Abstraction has 291 states and 604 transitions. [2025-04-13 21:51:03,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-13 21:51:03,424 INFO L278 IsEmpty]: Start isEmpty. Operand 291 states and 604 transitions. [2025-04-13 21:51:03,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:51:03,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:03,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:03,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:51:03,425 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:03,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash -832461693, now seen corresponding path program 3 times [2025-04-13 21:51:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:03,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801576237] [2025-04-13 21:51:03,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:51:03,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:03,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:51:03,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:51:03,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:51:03,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:03,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:51:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:51:03,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:51:03,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:03,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:03,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:51:03,488 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:51:03,489 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 21:51:03,490 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 21:51:03,490 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 21:51:03,490 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 21:51:03,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 21:51:03,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 21:51:03,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-13 21:51:03,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-13 21:51:03,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:51:03,493 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 21:51:03,542 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:51:03,542 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:51:03,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:51:03 BasicIcfg [2025-04-13 21:51:03,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:51:03,548 INFO L158 Benchmark]: Toolchain (without parser) took 5049.07ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 97.2MB in the beginning and 139.3MB in the end (delta: -42.2MB). Peak memory consumption was 135.7MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,548 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:51:03,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.05ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 63.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 60.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,549 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 56.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,549 INFO L158 Benchmark]: IcfgBuilder took 767.61ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 62.2MB in the end (delta: -5.3MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,549 INFO L158 Benchmark]: TraceAbstraction took 3628.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 61.4MB in the beginning and 139.3MB in the end (delta: -77.9MB). Peak memory consumption was 97.6MB. Max. memory is 8.0GB. [2025-04-13 21:51:03,551 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 541.05ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 63.2MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 60.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 142.6MB. Free memory was 60.4MB in the beginning and 56.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 767.61ms. Allocated memory is still 142.6MB. Free memory was 56.9MB in the beginning and 62.2MB in the end (delta: -5.3MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * TraceAbstraction took 3628.85ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 61.4MB in the beginning and 139.3MB in the end (delta: -77.9MB). Peak memory consumption was 97.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=0] [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=0] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3931] 0 return 0; [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, status={5:0}, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3941] 0 data->shared.a = 3 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3907] 2 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3944] 0 data->shared.b = 3 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\at(arg, Pre)={6:24}, \at(expression, Pre)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 49 locations, 56 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 765 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 20 mSDtfsCounter, 765 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=503occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 242 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:51:03,566 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 Received shutdown request...