/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/weaver/popl20-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:18:59,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:18:59,509 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 23:18:59,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:18:59,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:18:59,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:18:59,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:18:59,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:18:59,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:18:59,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:18:59,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:18:59,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:18:59,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:18:59,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:18:59,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:18:59,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:18:59,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:18:59,529 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 23:18:59,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:18:59,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:18:59,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:18:59,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:18:59,749 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:18:59,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-04-13 23:19:01,054 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad435f06a/a9f2c74b435d41fba9e81d4a19cdfc51/FLAG55a329bf8 [2025-04-13 23:19:01,256 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:19:01,256 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2025-04-13 23:19:01,263 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad435f06a/a9f2c74b435d41fba9e81d4a19cdfc51/FLAG55a329bf8 [2025-04-13 23:19:02,055 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad435f06a/a9f2c74b435d41fba9e81d4a19cdfc51 [2025-04-13 23:19:02,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:19:02,059 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:19:02,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:19:02,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:19:02,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:19:02,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d07f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02, skipping insertion in model container [2025-04-13 23:19:02,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:19:02,246 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c[2854,2867] [2025-04-13 23:19:02,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:19:02,267 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:19:02,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c[2854,2867] [2025-04-13 23:19:02,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:19:02,312 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:19:02,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02 WrapperNode [2025-04-13 23:19:02,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:19:02,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:19:02,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:19:02,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:19:02,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,343 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 210 [2025-04-13 23:19:02,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:19:02,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:19:02,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:19:02,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:19:02,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,371 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 23:19:02,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:19:02,392 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:19:02,392 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:19:02,392 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:19:02,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (1/1) ... [2025-04-13 23:19:02,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:19:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:02,418 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 23:19:02,424 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 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:19:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:19:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:19:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:19:02,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:19:02,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:19:02,440 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 23:19:02,534 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:19:02,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:19:02,922 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:19:02,923 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:19:02,923 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:19:03,258 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:19:03,260 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:19:03,264 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:19:03,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:19:03 BoogieIcfgContainer [2025-04-13 23:19:03,264 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:19:03,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:19:03,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:19:03,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:19:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:19:02" (1/3) ... [2025-04-13 23:19:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2420e8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:19:03, skipping insertion in model container [2025-04-13 23:19:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:19:02" (2/3) ... [2025-04-13 23:19:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2420e8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:19:03, skipping insertion in model container [2025-04-13 23:19:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:19:03" (3/3) ... [2025-04-13 23:19:03,272 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2025-04-13 23:19:03,283 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:19:03,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-min.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 23:19:03,285 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:19:03,333 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:19:03,356 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 23:19:03,388 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 23:19:03,406 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:19:03,415 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;@6e0f4fd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:19:03,415 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:19:03,417 INFO L278 IsEmpty]: Start isEmpty. Operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 23:19:03,426 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:19:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:03,426 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 23:19:03,427 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:03,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash -735844364, now seen corresponding path program 1 times [2025-04-13 23:19:03,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:03,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325180146] [2025-04-13 23:19:03,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:03,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:19:03,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:19:03,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:03,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:03,743 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 23:19:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:03,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325180146] [2025-04-13 23:19:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325180146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:19:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580224979] [2025-04-13 23:19:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:03,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:19:03,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:03,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:19:03,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:19:03,764 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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 23:19:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:03,902 INFO L93 Difference]: Finished difference Result 421 states and 1633 transitions. [2025-04-13 23:19:03,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:19:03,904 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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 23:19:03,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:03,911 INFO L225 Difference]: With dead ends: 421 [2025-04-13 23:19:03,911 INFO L226 Difference]: Without dead ends: 212 [2025-04-13 23:19:03,913 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 23:19:03,915 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:03,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-04-13 23:19:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-04-13 23:19:03,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 3.876777251184834) internal successors, (818), 211 states have internal predecessors, (818), 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 23:19:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 818 transitions. [2025-04-13 23:19:03,959 INFO L79 Accepts]: Start accepts. Automaton has 212 states and 818 transitions. Word has length 18 [2025-04-13 23:19:03,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:03,959 INFO L485 AbstractCegarLoop]: Abstraction has 212 states and 818 transitions. [2025-04-13 23:19:03,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 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 23:19:03,959 INFO L278 IsEmpty]: Start isEmpty. Operand 212 states and 818 transitions. [2025-04-13 23:19:03,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:19:03,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:03,961 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 23:19:03,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:19:03,961 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:03,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:03,961 INFO L85 PathProgramCache]: Analyzing trace with hash 394273676, now seen corresponding path program 1 times [2025-04-13 23:19:03,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:03,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034099735] [2025-04-13 23:19:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:03,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:03,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:19:03,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:19:03,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:03,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:19:04,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:04,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034099735] [2025-04-13 23:19:04,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034099735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:04,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:04,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:19:04,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230959562] [2025-04-13 23:19:04,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:04,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:19:04,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:04,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:19:04,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:04,143 INFO L87 Difference]: Start difference. First operand 212 states and 818 transitions. Second operand has 4 states, 4 states have (on average 4.75) 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 23:19:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:04,227 INFO L93 Difference]: Finished difference Result 422 states and 1634 transitions. [2025-04-13 23:19:04,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:19:04,227 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) 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 23:19:04,227 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:04,229 INFO L225 Difference]: With dead ends: 422 [2025-04-13 23:19:04,229 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 23:19:04,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:19:04,232 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:04,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 23:19:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-04-13 23:19:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 3.8497652582159625) internal successors, (820), 213 states have internal predecessors, (820), 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 23:19:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 820 transitions. [2025-04-13 23:19:04,251 INFO L79 Accepts]: Start accepts. Automaton has 214 states and 820 transitions. Word has length 19 [2025-04-13 23:19:04,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:04,251 INFO L485 AbstractCegarLoop]: Abstraction has 214 states and 820 transitions. [2025-04-13 23:19:04,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) 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 23:19:04,251 INFO L278 IsEmpty]: Start isEmpty. Operand 214 states and 820 transitions. [2025-04-13 23:19:04,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:19:04,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:04,253 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] [2025-04-13 23:19:04,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:19:04,253 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:04,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 690841733, now seen corresponding path program 1 times [2025-04-13 23:19:04,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:04,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787294557] [2025-04-13 23:19:04,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:19:04,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:19:04,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:04,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:04,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787294557] [2025-04-13 23:19:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787294557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:04,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:04,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:19:04,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948994489] [2025-04-13 23:19:04,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:04,421 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:19:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:04,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:19:04,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:19:04,422 INFO L87 Difference]: Start difference. First operand 214 states and 820 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 23:19:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:04,496 INFO L93 Difference]: Finished difference Result 332 states and 1271 transitions. [2025-04-13 23:19:04,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:19:04,497 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-04-13 23:19:04,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:04,500 INFO L225 Difference]: With dead ends: 332 [2025-04-13 23:19:04,500 INFO L226 Difference]: Without dead ends: 301 [2025-04-13 23:19:04,500 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 23:19:04,501 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:04,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:04,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-13 23:19:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 272. [2025-04-13 23:19:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.800738007380074) internal successors, (1030), 271 states have internal predecessors, (1030), 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 23:19:04,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 1030 transitions. [2025-04-13 23:19:04,533 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 1030 transitions. Word has length 21 [2025-04-13 23:19:04,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:04,533 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 1030 transitions. [2025-04-13 23:19:04,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 23:19:04,534 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 1030 transitions. [2025-04-13 23:19:04,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:19:04,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:04,536 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, 1, 1, 1] [2025-04-13 23:19:04,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:19:04,536 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:04,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1265493051, now seen corresponding path program 1 times [2025-04-13 23:19:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:04,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016782230] [2025-04-13 23:19:04,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:04,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:04,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:19:04,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:19:04,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:04,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:04,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016782230] [2025-04-13 23:19:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016782230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:19:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131772579] [2025-04-13 23:19:04,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:04,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:19:04,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:04,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:19:04,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:19:04,612 INFO L87 Difference]: Start difference. First operand 272 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 23:19:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:04,687 INFO L93 Difference]: Finished difference Result 402 states and 1379 transitions. [2025-04-13 23:19:04,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:19:04,687 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) Word has length 25 [2025-04-13 23:19:04,687 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:04,690 INFO L225 Difference]: With dead ends: 402 [2025-04-13 23:19:04,690 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 23:19:04,690 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 23:19:04,692 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 15 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:04,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:04,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 23:19:04,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 272. [2025-04-13 23:19:04,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.7527675276752768) internal successors, (1017), 271 states have internal predecessors, (1017), 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 23:19:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 1017 transitions. [2025-04-13 23:19:04,712 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 1017 transitions. Word has length 25 [2025-04-13 23:19:04,712 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:04,712 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 1017 transitions. [2025-04-13 23:19:04,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 23:19:04,712 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 1017 transitions. [2025-04-13 23:19:04,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:19:04,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:04,713 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, 1, 1, 1] [2025-04-13 23:19:04,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:19:04,713 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:04,713 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 441635087, now seen corresponding path program 2 times [2025-04-13 23:19:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:04,713 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357200887] [2025-04-13 23:19:04,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:19:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:04,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:19:04,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-04-13 23:19:04,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:19:04,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:04,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:04,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357200887] [2025-04-13 23:19:04,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357200887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:04,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:04,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:19:04,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420908574] [2025-04-13 23:19:04,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:04,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:19:04,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:04,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:19:04,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:19:04,782 INFO L87 Difference]: Start difference. First operand 272 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 23:19:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:04,862 INFO L93 Difference]: Finished difference Result 388 states and 1415 transitions. [2025-04-13 23:19:04,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:19:04,862 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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) Word has length 25 [2025-04-13 23:19:04,863 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:04,865 INFO L225 Difference]: With dead ends: 388 [2025-04-13 23:19:04,866 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 23:19:04,866 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 23:19:04,868 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 14 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:04,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 23:19:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 286. [2025-04-13 23:19:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.712280701754386) internal successors, (1058), 285 states have internal predecessors, (1058), 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 23:19:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 1058 transitions. [2025-04-13 23:19:04,885 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 1058 transitions. Word has length 25 [2025-04-13 23:19:04,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:04,886 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 1058 transitions. [2025-04-13 23:19:04,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-13 23:19:04,886 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 1058 transitions. [2025-04-13 23:19:04,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:19:04,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:04,888 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, 1, 1, 1] [2025-04-13 23:19:04,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:19:04,888 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:04,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2061323495, now seen corresponding path program 3 times [2025-04-13 23:19:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:04,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488192360] [2025-04-13 23:19:04,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:04,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:19:04,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 25 statements. [2025-04-13 23:19:04,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:19:04,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:04,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:19:04,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:04,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488192360] [2025-04-13 23:19:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488192360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:04,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:19:04,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127156554] [2025-04-13 23:19:04,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:04,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:19:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:04,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:19:04,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:04,956 INFO L87 Difference]: Start difference. First operand 286 states and 1058 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-13 23:19:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:05,053 INFO L93 Difference]: Finished difference Result 372 states and 1341 transitions. [2025-04-13 23:19:05,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:19:05,054 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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) Word has length 25 [2025-04-13 23:19:05,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:05,057 INFO L225 Difference]: With dead ends: 372 [2025-04-13 23:19:05,057 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 23:19:05,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:05,058 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 31 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:05,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 2 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 23:19:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 272. [2025-04-13 23:19:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.5719557195571956) internal successors, (968), 271 states have internal predecessors, (968), 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 23:19:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 968 transitions. [2025-04-13 23:19:05,072 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 968 transitions. Word has length 25 [2025-04-13 23:19:05,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:05,072 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 968 transitions. [2025-04-13 23:19:05,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-13 23:19:05,072 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 968 transitions. [2025-04-13 23:19:05,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:19:05,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:05,073 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, 1, 1, 1, 1, 1] [2025-04-13 23:19:05,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:19:05,073 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:05,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:05,074 INFO L85 PathProgramCache]: Analyzing trace with hash 383057012, now seen corresponding path program 1 times [2025-04-13 23:19:05,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:05,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640510665] [2025-04-13 23:19:05,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:05,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:19:05,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:19:05,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:05,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:19:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:05,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640510665] [2025-04-13 23:19:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640510665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:05,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942769843] [2025-04-13 23:19:05,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:05,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:05,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:05,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:19:05,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:19:05,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:19:05,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:19:05,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:05,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:19:05,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:19:05,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:19:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942769843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:05,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-04-13 23:19:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653537590] [2025-04-13 23:19:05,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:05,410 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:19:05,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:05,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:19:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:19:05,411 INFO L87 Difference]: Start difference. First operand 272 states and 968 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 23:19:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:05,591 INFO L93 Difference]: Finished difference Result 546 states and 1942 transitions. [2025-04-13 23:19:05,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:19:05,591 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 27 [2025-04-13 23:19:05,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:05,594 INFO L225 Difference]: With dead ends: 546 [2025-04-13 23:19:05,594 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 23:19:05,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:19:05,596 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 5 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:05,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 5 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:05,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 23:19:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-04-13 23:19:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 274 states have (on average 3.5437956204379564) internal successors, (971), 274 states have internal predecessors, (971), 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 23:19:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 971 transitions. [2025-04-13 23:19:05,613 INFO L79 Accepts]: Start accepts. Automaton has 275 states and 971 transitions. Word has length 27 [2025-04-13 23:19:05,614 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:05,614 INFO L485 AbstractCegarLoop]: Abstraction has 275 states and 971 transitions. [2025-04-13 23:19:05,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 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 23:19:05,614 INFO L278 IsEmpty]: Start isEmpty. Operand 275 states and 971 transitions. [2025-04-13 23:19:05,615 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:19:05,615 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:05,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:05,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:19:05,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:05,816 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:05,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:05,816 INFO L85 PathProgramCache]: Analyzing trace with hash 656166147, now seen corresponding path program 2 times [2025-04-13 23:19:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:05,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215160117] [2025-04-13 23:19:05,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:19:05,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:05,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:19:05,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 23:19:05,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:19:05,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:05,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:05,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215160117] [2025-04-13 23:19:05,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215160117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:05,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:05,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:19:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132354310] [2025-04-13 23:19:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:05,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:19:05,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:05,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:19:05,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:05,899 INFO L87 Difference]: Start difference. First operand 275 states and 971 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 23:19:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:06,032 INFO L93 Difference]: Finished difference Result 574 states and 1969 transitions. [2025-04-13 23:19:06,032 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:19:06,032 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2025-04-13 23:19:06,032 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:06,036 INFO L225 Difference]: With dead ends: 574 [2025-04-13 23:19:06,036 INFO L226 Difference]: Without dead ends: 421 [2025-04-13 23:19:06,037 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:06,037 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:06,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 7 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-13 23:19:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 307. [2025-04-13 23:19:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 3.5359477124183005) internal successors, (1082), 306 states have internal predecessors, (1082), 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 23:19:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 1082 transitions. [2025-04-13 23:19:06,060 INFO L79 Accepts]: Start accepts. Automaton has 307 states and 1082 transitions. Word has length 30 [2025-04-13 23:19:06,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:06,060 INFO L485 AbstractCegarLoop]: Abstraction has 307 states and 1082 transitions. [2025-04-13 23:19:06,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 23:19:06,061 INFO L278 IsEmpty]: Start isEmpty. Operand 307 states and 1082 transitions. [2025-04-13 23:19:06,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:19:06,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:06,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:06,062 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:19:06,062 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:06,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1404906721, now seen corresponding path program 3 times [2025-04-13 23:19:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:06,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981342771] [2025-04-13 23:19:06,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:06,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:19:06,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-04-13 23:19:06,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:19:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:06,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981342771] [2025-04-13 23:19:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981342771] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:06,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:19:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316661028] [2025-04-13 23:19:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:06,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:19:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:06,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:19:06,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:19:06,161 INFO L87 Difference]: Start difference. First operand 307 states and 1082 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 23:19:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:06,288 INFO L93 Difference]: Finished difference Result 525 states and 1986 transitions. [2025-04-13 23:19:06,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:19:06,289 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 30 [2025-04-13 23:19:06,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:06,292 INFO L225 Difference]: With dead ends: 525 [2025-04-13 23:19:06,293 INFO L226 Difference]: Without dead ends: 453 [2025-04-13 23:19:06,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:19:06,294 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:06,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 6 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-04-13 23:19:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 349. [2025-04-13 23:19:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5833333333333335) internal successors, (1247), 348 states have internal predecessors, (1247), 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 23:19:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1247 transitions. [2025-04-13 23:19:06,325 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1247 transitions. Word has length 30 [2025-04-13 23:19:06,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:06,326 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1247 transitions. [2025-04-13 23:19:06,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 23:19:06,326 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1247 transitions. [2025-04-13 23:19:06,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:19:06,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:06,328 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:06,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:19:06,328 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:06,328 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:06,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1801897627, now seen corresponding path program 4 times [2025-04-13 23:19:06,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:06,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481190700] [2025-04-13 23:19:06,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:19:06,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:06,343 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:19:06,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 23:19:06,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:19:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 23:19:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:06,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481190700] [2025-04-13 23:19:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481190700] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:19:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:19:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:19:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015476947] [2025-04-13 23:19:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:19:06,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:19:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:19:06,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:19:06,374 INFO L87 Difference]: Start difference. First operand 349 states and 1247 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 23:19:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:06,490 INFO L93 Difference]: Finished difference Result 531 states and 1927 transitions. [2025-04-13 23:19:06,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:19:06,490 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 30 [2025-04-13 23:19:06,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:06,495 INFO L225 Difference]: With dead ends: 531 [2025-04-13 23:19:06,495 INFO L226 Difference]: Without dead ends: 459 [2025-04-13 23:19:06,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:19:06,496 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 30 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:06,496 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:19:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-04-13 23:19:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 349. [2025-04-13 23:19:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.5833333333333335) internal successors, (1247), 348 states have internal predecessors, (1247), 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 23:19:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1247 transitions. [2025-04-13 23:19:06,527 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1247 transitions. Word has length 30 [2025-04-13 23:19:06,527 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:06,527 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1247 transitions. [2025-04-13 23:19:06,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 23:19:06,527 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1247 transitions. [2025-04-13 23:19:06,529 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 23:19:06,529 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:06,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:06,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:19:06,530 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:19:06,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1046167998, now seen corresponding path program 1 times [2025-04-13 23:19:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:06,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13469177] [2025-04-13 23:19:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:06,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 23:19:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:19:06,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:19:08,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:08,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13469177] [2025-04-13 23:19:08,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13469177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:08,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213559718] [2025-04-13 23:19:08,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:19:08,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:08,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:08,351 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-13 23:19:08,352 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-13 23:19:08,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 23:19:08,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 23:19:08,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:19:08,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:08,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:19:08,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:08,880 INFO L325 Elim1Store]: treesize reduction 80, result has 60.2 percent of original size [2025-04-13 23:19:08,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 171