/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-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:17:17,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:17:17,608 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:17:17,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:17:17,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:17:17,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:17:17,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:17:17,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:17:17,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:17:17,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:17:17,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:17:17,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:17:17,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:17:17,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:17:17,635 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:17:17,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:17:17,636 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:17:17,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:17,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:17,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:17:17,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:17:17,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:17:17,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:17:17,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:17:17,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:17:17,638 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:17:17,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:17:17,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:17:17,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:17:17,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:17:17,847 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:17:17,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 23:17:19,113 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca45c6d8/49e9b26fab834c97a83e4065aefaff55/FLAG406388384 [2025-04-13 23:17:19,305 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:17:19,306 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 23:17:19,312 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca45c6d8/49e9b26fab834c97a83e4065aefaff55/FLAG406388384 [2025-04-13 23:17:20,164 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca45c6d8/49e9b26fab834c97a83e4065aefaff55 [2025-04-13 23:17:20,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:17:20,166 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:17:20,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:17:20,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:17:20,170 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:17:20,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfcb5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20, skipping insertion in model container [2025-04-13 23:17:20,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:17:20,300 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-simple-array-sum.wvr.c[2429,2442] [2025-04-13 23:17:20,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:17:20,316 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:17:20,333 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-simple-array-sum.wvr.c[2429,2442] [2025-04-13 23:17:20,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:17:20,346 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:17:20,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20 WrapperNode [2025-04-13 23:17:20,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:17:20,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:17:20,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:17:20,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:17:20,352 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:17:20" (1/1) ... [2025-04-13 23:17:20,358 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:17:20" (1/1) ... [2025-04-13 23:17:20,376 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-04-13 23:17:20,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:17:20,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:17:20,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:17:20,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:17:20,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,405 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 23:17:20,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:17:20,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:17:20,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:17:20,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:17:20,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (1/1) ... [2025-04-13 23:17:20,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:17:20,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:20,450 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:17:20,452 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:17:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:17:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:17:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:17:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:17:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:17:20,470 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:17:20,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:17:20,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:17:20,471 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:17:20,552 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:17:20,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:17:20,773 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:17:20,777 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:17:20,777 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:17:20,939 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:17:20,941 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:17:20,942 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:17:20,947 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:17:20,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:17:20 BoogieIcfgContainer [2025-04-13 23:17:20,947 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:17:20,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:17:20,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:17:20,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:17:20,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:17:20" (1/3) ... [2025-04-13 23:17:20,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14174969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:17:20, skipping insertion in model container [2025-04-13 23:17:20,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:17:20" (2/3) ... [2025-04-13 23:17:20,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14174969 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:17:20, skipping insertion in model container [2025-04-13 23:17:20,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:17:20" (3/3) ... [2025-04-13 23:17:20,954 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-04-13 23:17:20,963 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:17:20,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 31 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 23:17:20,964 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:17:21,027 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:17:21,051 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 43 transitions, 107 flow [2025-04-13 23:17:21,108 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 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:17:21,126 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:17:21,132 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;@1195af4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:17:21,132 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:17:21,135 INFO L278 IsEmpty]: Start isEmpty. Operand has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 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:17:21,146 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:17:21,146 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:21,146 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:21,148 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:17:21,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1634728296, now seen corresponding path program 1 times [2025-04-13 23:17:21,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:21,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520653268] [2025-04-13 23:17:21,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:21,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:21,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:17:21,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:17:21,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:21,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:21,696 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:17:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:21,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520653268] [2025-04-13 23:17:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520653268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:17:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295582575] [2025-04-13 23:17:21,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:21,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:21,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:21,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:21,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:21,718 INFO L87 Difference]: Start difference. First operand has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 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 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:17:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:21,931 INFO L93 Difference]: Finished difference Result 1161 states and 4963 transitions. [2025-04-13 23:17:21,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:17:21,933 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2025-04-13 23:17:21,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:21,953 INFO L225 Difference]: With dead ends: 1161 [2025-04-13 23:17:21,953 INFO L226 Difference]: Without dead ends: 682 [2025-04-13 23:17:21,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 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:17:21,961 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:21,962 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-04-13 23:17:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 442. [2025-04-13 23:17:22,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.673469387755102) internal successors, (1620), 441 states have internal predecessors, (1620), 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:17:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1620 transitions. [2025-04-13 23:17:22,034 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1620 transitions. Word has length 16 [2025-04-13 23:17:22,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,035 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1620 transitions. [2025-04-13 23:17:22,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:17:22,035 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1620 transitions. [2025-04-13 23:17:22,038 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:17:22,038 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,038 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:17:22,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:17:22,039 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:17:22,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1414946489, now seen corresponding path program 1 times [2025-04-13 23:17:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485754651] [2025-04-13 23:17:22,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:22,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:17:22,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:17:22,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:22,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:22,105 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:17:22,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:22,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485754651] [2025-04-13 23:17:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485754651] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:22,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560512108] [2025-04-13 23:17:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:22,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:17:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:22,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:17:22,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:17:22,107 INFO L87 Difference]: Start difference. First operand 442 states and 1620 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:22,188 INFO L93 Difference]: Finished difference Result 793 states and 2621 transitions. [2025-04-13 23:17:22,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:17:22,188 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:17:22,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:22,195 INFO L225 Difference]: With dead ends: 793 [2025-04-13 23:17:22,195 INFO L226 Difference]: Without dead ends: 542 [2025-04-13 23:17:22,196 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:17:22,196 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:22,197 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-04-13 23:17:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 428. [2025-04-13 23:17:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.5995316159250588) internal successors, (1537), 427 states have internal predecessors, (1537), 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:17:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1537 transitions. [2025-04-13 23:17:22,228 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 1537 transitions. Word has length 18 [2025-04-13 23:17:22,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,228 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 1537 transitions. [2025-04-13 23:17:22,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:22,228 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 1537 transitions. [2025-04-13 23:17:22,229 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:17:22,229 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,230 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:17:22,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:17:22,230 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:17:22,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1068876667, now seen corresponding path program 2 times [2025-04-13 23:17:22,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942830717] [2025-04-13 23:17:22,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:22,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:17:22,246 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:17:22,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:17:22,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:22,305 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:17:22,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:22,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942830717] [2025-04-13 23:17:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942830717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039620273] [2025-04-13 23:17:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:22,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:17:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:22,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:17:22,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:17:22,306 INFO L87 Difference]: Start difference. First operand 428 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:22,381 INFO L93 Difference]: Finished difference Result 690 states and 2475 transitions. [2025-04-13 23:17:22,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:17:22,382 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 23:17:22,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:22,387 INFO L225 Difference]: With dead ends: 690 [2025-04-13 23:17:22,387 INFO L226 Difference]: Without dead ends: 600 [2025-04-13 23:17:22,388 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:17:22,388 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 18 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:22,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-04-13 23:17:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 504. [2025-04-13 23:17:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 503 states have (on average 3.6202783300198806) internal successors, (1821), 503 states have internal predecessors, (1821), 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:17:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1821 transitions. [2025-04-13 23:17:22,407 INFO L79 Accepts]: Start accepts. Automaton has 504 states and 1821 transitions. Word has length 18 [2025-04-13 23:17:22,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,407 INFO L485 AbstractCegarLoop]: Abstraction has 504 states and 1821 transitions. [2025-04-13 23:17:22,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:22,407 INFO L278 IsEmpty]: Start isEmpty. Operand 504 states and 1821 transitions. [2025-04-13 23:17:22,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:17:22,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,409 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:17:22,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:17:22,409 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:17:22,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1665287849, now seen corresponding path program 3 times [2025-04-13 23:17:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651576178] [2025-04-13 23:17:22,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:17:22,423 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:17:22,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:17:22,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:22,465 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:17:22,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:22,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651576178] [2025-04-13 23:17:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651576178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:22,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:17:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022691257] [2025-04-13 23:17:22,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:22,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:22,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:22,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:22,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:22,466 INFO L87 Difference]: Start difference. First operand 504 states and 1821 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:17:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:22,546 INFO L93 Difference]: Finished difference Result 714 states and 2519 transitions. [2025-04-13 23:17:22,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:17:22,546 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:17:22,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:22,552 INFO L225 Difference]: With dead ends: 714 [2025-04-13 23:17:22,552 INFO L226 Difference]: Without dead ends: 562 [2025-04-13 23:17:22,552 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:17:22,553 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:22,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-04-13 23:17:22,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 390. [2025-04-13 23:17:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.308483290488432) internal successors, (1287), 389 states have internal predecessors, (1287), 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:17:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1287 transitions. [2025-04-13 23:17:22,571 INFO L79 Accepts]: Start accepts. Automaton has 390 states and 1287 transitions. Word has length 18 [2025-04-13 23:17:22,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,571 INFO L485 AbstractCegarLoop]: Abstraction has 390 states and 1287 transitions. [2025-04-13 23:17:22,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:17:22,571 INFO L278 IsEmpty]: Start isEmpty. Operand 390 states and 1287 transitions. [2025-04-13 23:17:22,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 23:17:22,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,573 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] [2025-04-13 23:17:22,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:17:22,573 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:17:22,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1125156024, now seen corresponding path program 1 times [2025-04-13 23:17:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639957706] [2025-04-13 23:17:22,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 23:17:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 23:17:22,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:22,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:22,646 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:17:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:22,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639957706] [2025-04-13 23:17:22,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639957706] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:22,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:22,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:17:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448949721] [2025-04-13 23:17:22,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:22,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:22,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:22,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:22,647 INFO L87 Difference]: Start difference. First operand 390 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:17:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:22,728 INFO L93 Difference]: Finished difference Result 780 states and 2575 transitions. [2025-04-13 23:17:22,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:22,729 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2025-04-13 23:17:22,729 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:22,731 INFO L225 Difference]: With dead ends: 780 [2025-04-13 23:17:22,732 INFO L226 Difference]: Without dead ends: 392 [2025-04-13 23:17:22,732 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:17:22,733 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:22,733 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-04-13 23:17:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-04-13 23:17:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 3.296675191815857) internal successors, (1289), 391 states have internal predecessors, (1289), 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:17:22,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1289 transitions. [2025-04-13 23:17:22,755 INFO L79 Accepts]: Start accepts. Automaton has 392 states and 1289 transitions. Word has length 26 [2025-04-13 23:17:22,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,756 INFO L485 AbstractCegarLoop]: Abstraction has 392 states and 1289 transitions. [2025-04-13 23:17:22,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 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:17:22,757 INFO L278 IsEmpty]: Start isEmpty. Operand 392 states and 1289 transitions. [2025-04-13 23:17:22,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:17:22,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,758 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, 1] [2025-04-13 23:17:22,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:17:22,758 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:17:22,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2076928544, now seen corresponding path program 1 times [2025-04-13 23:17:22,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413313406] [2025-04-13 23:17:22,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:22,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:17:22,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:17:22,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:22,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:17:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:22,813 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413313406] [2025-04-13 23:17:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413313406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:22,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:17:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781563854] [2025-04-13 23:17:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:22,814 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:17:22,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:22,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:17:22,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:17:22,814 INFO L87 Difference]: Start difference. First operand 392 states and 1289 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:17:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:22,891 INFO L93 Difference]: Finished difference Result 785 states and 2595 transitions. [2025-04-13 23:17:22,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:17:22,891 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 28 [2025-04-13 23:17:22,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:22,895 INFO L225 Difference]: With dead ends: 785 [2025-04-13 23:17:22,895 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 23:17:22,896 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:17:22,897 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 27 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:22,898 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:22,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 23:17:22,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-04-13 23:17:22,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.090551181102362) internal successors, (1570), 508 states have internal predecessors, (1570), 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:17:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1570 transitions. [2025-04-13 23:17:22,919 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1570 transitions. Word has length 28 [2025-04-13 23:17:22,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:22,919 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1570 transitions. [2025-04-13 23:17:22,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:17:22,920 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1570 transitions. [2025-04-13 23:17:22,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 23:17:22,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:22,921 INFO L218 NwaCegarLoop]: trace histogram [2, 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:17:22,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:17:22,921 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:17:22,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1098440136, now seen corresponding path program 1 times [2025-04-13 23:17:22,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:22,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435113739] [2025-04-13 23:17:22,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:22,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:22,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 23:17:22,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:17:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:17:23,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:23,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435113739] [2025-04-13 23:17:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435113739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:23,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958177118] [2025-04-13 23:17:23,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:23,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:23,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:23,038 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:17:23,039 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:17:23,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 23:17:23,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 23:17:23,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:23,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:23,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:17:23,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:17:23,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:17:23,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958177118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:23,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:23,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 23:17:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179355304] [2025-04-13 23:17:23,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:23,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:17:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:23,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:17:23,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:17:23,289 INFO L87 Difference]: Start difference. First operand 509 states and 1570 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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:17:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:23,430 INFO L93 Difference]: Finished difference Result 1017 states and 3140 transitions. [2025-04-13 23:17:23,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:17:23,431 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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 33 [2025-04-13 23:17:23,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:23,434 INFO L225 Difference]: With dead ends: 1017 [2025-04-13 23:17:23,434 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 23:17:23,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:17:23,437 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:23,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 8 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 23:17:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-04-13 23:17:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.0823529411764707) internal successors, (1572), 510 states have internal predecessors, (1572), 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:17:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1572 transitions. [2025-04-13 23:17:23,452 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 1572 transitions. Word has length 33 [2025-04-13 23:17:23,452 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:23,452 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 1572 transitions. [2025-04-13 23:17:23,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 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:17:23,452 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 1572 transitions. [2025-04-13 23:17:23,454 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 23:17:23,454 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:23,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-13 23:17:23,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:23,659 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:17:23,659 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:17:23,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1943241584, now seen corresponding path program 2 times [2025-04-13 23:17:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:23,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91305733] [2025-04-13 23:17:23,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:23,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:23,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:23,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:17:23,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:23,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:23,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:23,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91305733] [2025-04-13 23:17:23,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91305733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:23,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:23,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:17:23,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894600669] [2025-04-13 23:17:23,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:23,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:23,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:23,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:17:23,760 INFO L87 Difference]: Start difference. First operand 511 states and 1572 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:17:23,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:23,936 INFO L93 Difference]: Finished difference Result 951 states and 2929 transitions. [2025-04-13 23:17:23,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:17:23,936 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 35 [2025-04-13 23:17:23,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:23,942 INFO L225 Difference]: With dead ends: 951 [2025-04-13 23:17:23,942 INFO L226 Difference]: Without dead ends: 867 [2025-04-13 23:17:23,942 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:17:23,942 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 145 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:23,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 5 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-04-13 23:17:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 643. [2025-04-13 23:17:23,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 3.143302180685358) internal successors, (2018), 642 states have internal predecessors, (2018), 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:17:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 2018 transitions. [2025-04-13 23:17:23,963 INFO L79 Accepts]: Start accepts. Automaton has 643 states and 2018 transitions. Word has length 35 [2025-04-13 23:17:23,963 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:23,963 INFO L485 AbstractCegarLoop]: Abstraction has 643 states and 2018 transitions. [2025-04-13 23:17:23,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:17:23,963 INFO L278 IsEmpty]: Start isEmpty. Operand 643 states and 2018 transitions. [2025-04-13 23:17:23,964 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 23:17:23,964 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:23,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-13 23:17:23,965 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:17:23,965 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:17:23,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:23,965 INFO L85 PathProgramCache]: Analyzing trace with hash -489257036, now seen corresponding path program 3 times [2025-04-13 23:17:23,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:23,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413105163] [2025-04-13 23:17:23,965 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:23,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:23,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:17:23,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:23,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:24,093 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:24,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:24,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413105163] [2025-04-13 23:17:24,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413105163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:17:24,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:17:24,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:17:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642419146] [2025-04-13 23:17:24,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:24,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:24,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:24,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:24,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:17:24,094 INFO L87 Difference]: Start difference. First operand 643 states and 2018 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:17:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:24,274 INFO L93 Difference]: Finished difference Result 1001 states and 3294 transitions. [2025-04-13 23:17:24,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:17:24,275 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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 35 [2025-04-13 23:17:24,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:24,281 INFO L225 Difference]: With dead ends: 1001 [2025-04-13 23:17:24,281 INFO L226 Difference]: Without dead ends: 923 [2025-04-13 23:17:24,281 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:17:24,283 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:24,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 9 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-04-13 23:17:24,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 827. [2025-04-13 23:17:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 826 states have (on average 3.2203389830508473) internal successors, (2660), 826 states have internal predecessors, (2660), 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:17:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 2660 transitions. [2025-04-13 23:17:24,310 INFO L79 Accepts]: Start accepts. Automaton has 827 states and 2660 transitions. Word has length 35 [2025-04-13 23:17:24,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:24,310 INFO L485 AbstractCegarLoop]: Abstraction has 827 states and 2660 transitions. [2025-04-13 23:17:24,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:17:24,310 INFO L278 IsEmpty]: Start isEmpty. Operand 827 states and 2660 transitions. [2025-04-13 23:17:24,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 23:17:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:24,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-13 23:17:24,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:17:24,313 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:17:24,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1899981070, now seen corresponding path program 4 times [2025-04-13 23:17:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:24,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476378273] [2025-04-13 23:17:24,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:24,325 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:24,332 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-04-13 23:17:24,332 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:17:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:24,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:24,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476378273] [2025-04-13 23:17:24,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476378273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:24,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889776307] [2025-04-13 23:17:24,380 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:24,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:24,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:24,382 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:17:24,383 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:17:24,434 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:24,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 35 statements. [2025-04-13 23:17:24,454 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:17:24,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:24,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:17:24,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:24,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:24,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889776307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:24,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:24,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-13 23:17:24,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387981683] [2025-04-13 23:17:24,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:24,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:24,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:24,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:17:24,543 INFO L87 Difference]: Start difference. First operand 827 states and 2660 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:17:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:24,676 INFO L93 Difference]: Finished difference Result 1238 states and 3990 transitions. [2025-04-13 23:17:24,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:17:24,677 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 35 [2025-04-13 23:17:24,677 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:24,684 INFO L225 Difference]: With dead ends: 1238 [2025-04-13 23:17:24,684 INFO L226 Difference]: Without dead ends: 1104 [2025-04-13 23:17:24,685 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:17:24,685 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 66 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:24,685 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 6 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2025-04-13 23:17:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 899. [2025-04-13 23:17:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 898 states have (on average 3.2138084632516706) internal successors, (2886), 898 states have internal predecessors, (2886), 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:17:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2886 transitions. [2025-04-13 23:17:24,712 INFO L79 Accepts]: Start accepts. Automaton has 899 states and 2886 transitions. Word has length 35 [2025-04-13 23:17:24,712 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:24,712 INFO L485 AbstractCegarLoop]: Abstraction has 899 states and 2886 transitions. [2025-04-13 23:17:24,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:17:24,713 INFO L278 IsEmpty]: Start isEmpty. Operand 899 states and 2886 transitions. [2025-04-13 23:17:24,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 23:17:24,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:24,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-04-13 23:17:24,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:24,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 23:17:24,916 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:17:24,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1350538820, now seen corresponding path program 5 times [2025-04-13 23:17:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:24,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259976733] [2025-04-13 23:17:24,916 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:24,926 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:24,940 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:17:24,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:24,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:25,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:25,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259976733] [2025-04-13 23:17:25,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259976733] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:25,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455081186] [2025-04-13 23:17:25,058 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:25,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:25,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:25,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:17:25,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:17:25,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-04-13 23:17:25,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:17:25,140 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:25,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:25,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:17:25,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:25,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:25,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:25,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455081186] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:25,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:17:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-04-13 23:17:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917971116] [2025-04-13 23:17:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:25,289 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:25,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:25,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:25,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:17:25,290 INFO L87 Difference]: Start difference. First operand 899 states and 2886 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:25,357 INFO L93 Difference]: Finished difference Result 1156 states and 3638 transitions. [2025-04-13 23:17:25,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:17:25,357 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 23:17:25,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:25,362 INFO L225 Difference]: With dead ends: 1156 [2025-04-13 23:17:25,362 INFO L226 Difference]: Without dead ends: 995 [2025-04-13 23:17:25,363 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:17:25,364 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 70 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:25,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 3 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-04-13 23:17:25,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 739. [2025-04-13 23:17:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.105691056910569) internal successors, (2292), 738 states have internal predecessors, (2292), 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:17:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2292 transitions. [2025-04-13 23:17:25,384 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 2292 transitions. Word has length 35 [2025-04-13 23:17:25,385 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:25,385 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 2292 transitions. [2025-04-13 23:17:25,385 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:17:25,385 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 2292 transitions. [2025-04-13 23:17:25,386 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:17:25,386 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:25,386 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-04-13 23:17:25,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:17:25,587 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:25,591 INFO L403 AbstractCegarLoop]: === Iteration 12 === 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:17:25,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1198749679, now seen corresponding path program 1 times [2025-04-13 23:17:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:25,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002406969] [2025-04-13 23:17:25,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:25,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 23:17:25,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:17:25,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:25,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 23:17:25,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:25,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002406969] [2025-04-13 23:17:25,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002406969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:25,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77038024] [2025-04-13 23:17:25,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:25,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:25,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:25,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:17:25,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:17:25,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 23:17:25,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:17:25,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:25,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:25,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:17:25,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 23:17:25,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 23:17:25,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77038024] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:25,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:17:25,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-13 23:17:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519736855] [2025-04-13 23:17:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:17:25,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:17:25,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:25,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:17:25,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:17:25,876 INFO L87 Difference]: Start difference. First operand 739 states and 2292 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:17:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:25,933 INFO L93 Difference]: Finished difference Result 1057 states and 3382 transitions. [2025-04-13 23:17:25,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:17:25,933 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 37 [2025-04-13 23:17:25,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:25,938 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 23:17:25,938 INFO L226 Difference]: Without dead ends: 976 [2025-04-13 23:17:25,939 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:17:25,939 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 37 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:25,939 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:17:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-04-13 23:17:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-04-13 23:17:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.187692307692308) internal successors, (3108), 975 states have internal predecessors, (3108), 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:17:25,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3108 transitions. [2025-04-13 23:17:25,958 INFO L79 Accepts]: Start accepts. Automaton has 976 states and 3108 transitions. Word has length 37 [2025-04-13 23:17:25,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:25,958 INFO L485 AbstractCegarLoop]: Abstraction has 976 states and 3108 transitions. [2025-04-13 23:17:25,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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:17:25,958 INFO L278 IsEmpty]: Start isEmpty. Operand 976 states and 3108 transitions. [2025-04-13 23:17:25,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 23:17:25,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:25,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-04-13 23:17:25,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:26,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:26,161 INFO L403 AbstractCegarLoop]: === Iteration 13 === 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:17:26,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:26,161 INFO L85 PathProgramCache]: Analyzing trace with hash -362226502, now seen corresponding path program 1 times [2025-04-13 23:17:26,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:26,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256050633] [2025-04-13 23:17:26,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:26,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:26,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:17:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:17:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 23:17:26,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:26,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256050633] [2025-04-13 23:17:26,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256050633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:26,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662130900] [2025-04-13 23:17:26,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:17:26,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:26,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:26,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:17:26,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:17:26,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 23:17:26,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:17:26,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:17:26,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:17:26,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 23:17:26,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 23:17:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662130900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:26,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:26,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-04-13 23:17:26,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742838355] [2025-04-13 23:17:26,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:26,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:17:26,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:26,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:17:26,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:17:26,350 INFO L87 Difference]: Start difference. First operand 976 states and 3108 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:17:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:26,468 INFO L93 Difference]: Finished difference Result 1682 states and 5502 transitions. [2025-04-13 23:17:26,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:17:26,468 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 40 [2025-04-13 23:17:26,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:26,475 INFO L225 Difference]: With dead ends: 1682 [2025-04-13 23:17:26,475 INFO L226 Difference]: Without dead ends: 1296 [2025-04-13 23:17:26,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:17:26,476 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:26,476 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 7 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:26,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2025-04-13 23:17:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1296. [2025-04-13 23:17:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 3.1837837837837837) internal successors, (4123), 1295 states have internal predecessors, (4123), 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:17:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4123 transitions. [2025-04-13 23:17:26,515 INFO L79 Accepts]: Start accepts. Automaton has 1296 states and 4123 transitions. Word has length 40 [2025-04-13 23:17:26,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:26,515 INFO L485 AbstractCegarLoop]: Abstraction has 1296 states and 4123 transitions. [2025-04-13 23:17:26,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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:17:26,515 INFO L278 IsEmpty]: Start isEmpty. Operand 1296 states and 4123 transitions. [2025-04-13 23:17:26,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:17:26,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:26,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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:17:26,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:26,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:17:26,718 INFO L403 AbstractCegarLoop]: === Iteration 14 === 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:17:26,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 843627510, now seen corresponding path program 2 times [2025-04-13 23:17:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:26,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248845618] [2025-04-13 23:17:26,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:26,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:17:26,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:17:26,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:26,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 23:17:26,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:26,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248845618] [2025-04-13 23:17:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248845618] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:26,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142110948] [2025-04-13 23:17:26,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:17:26,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:26,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:26,804 INFO L229 MonitoredProcess]: Starting monitored process 7 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:17:26,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:17:26,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:17:26,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:17:26,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:17:26,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:26,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:17:26,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:17:26,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:26,941 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 23:17:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142110948] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:26,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 9 [2025-04-13 23:17:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724453801] [2025-04-13 23:17:26,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:26,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:17:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:26,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:17:26,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:17:26,942 INFO L87 Difference]: Start difference. First operand 1296 states and 4123 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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:17:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:27,371 INFO L93 Difference]: Finished difference Result 2359 states and 7544 transitions. [2025-04-13 23:17:27,371 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:17:27,371 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 45 [2025-04-13 23:17:27,371 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:27,373 INFO L225 Difference]: With dead ends: 2359 [2025-04-13 23:17:27,373 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 23:17:27,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:17:27,376 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 171 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:27,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 34 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:17:27,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 23:17:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 23:17:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:17:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 23:17:27,378 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2025-04-13 23:17:27,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:27,378 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 23:17:27,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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:17:27,379 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 23:17:27,379 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 23:17:27,380 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:17:27,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:17:27,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:17:27,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:17:27,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:17:27,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:27,584 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1] [2025-04-13 23:17:27,586 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:17:27,586 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:17:27,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:17:27 BasicIcfg [2025-04-13 23:17:27,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:17:27,588 INFO L158 Benchmark]: Toolchain (without parser) took 7421.79ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 99.3MB in the beginning and 156.7MB in the end (delta: -57.3MB). Peak memory consumption was 116.0MB. Max. memory is 8.0GB. [2025-04-13 23:17:27,588 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:17:27,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.06ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:17:27,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.35ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:17:27,588 INFO L158 Benchmark]: Boogie Preprocessor took 44.25ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:17:27,589 INFO L158 Benchmark]: IcfgBuilder took 526.22ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 31.0MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 23:17:27,589 INFO L158 Benchmark]: TraceAbstraction took 6639.33ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 31.0MB in the beginning and 156.7MB in the end (delta: -125.7MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. [2025-04-13 23:17:27,590 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.06ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.6MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.35ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 83.0MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.25ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 526.22ms. Allocated memory is still 142.6MB. Free memory was 80.4MB in the beginning and 31.0MB in the end (delta: 49.4MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 6639.33ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 31.0MB in the beginning and 156.7MB in the end (delta: -125.7MB). Peak memory consumption was 48.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 73 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 835 mSDsluCounter, 94 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2277 IncrementalHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 34 mSDtfsCounter, 2277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 448 SyntacticMatches, 17 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1296occurred in iteration=13, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1403 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 644 NumberOfCodeBlocks, 638 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 2448 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 26 InterpolantComputations, 10 PerfectInterpolantSequences, 212/261 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 23:17:27,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...