/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:44:59,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:44:59,494 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 18:44:59,500 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:44:59,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:44:59,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:44:59,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:44:59,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:44:59,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:44:59,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:44:59,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:44:59,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:44:59,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:44:59,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:44:59,524 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:44:59,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:44:59,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:44:59,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:44:59,526 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:44:59,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:44:59,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:44:59,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:44:59,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:44:59,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:44:59,527 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 [2025-04-13 18:44:59,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:44:59,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:44:59,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:44:59,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:44:59,746 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:44:59,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-13 18:45:01,036 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c0e62bd/4dd53d05b2984b119d8fe820d8b8bb2b/FLAGda2c7537f [2025-04-13 18:45:01,185 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:45:01,185 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-13 18:45:01,190 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c0e62bd/4dd53d05b2984b119d8fe820d8b8bb2b/FLAGda2c7537f [2025-04-13 18:45:02,238 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c0e62bd/4dd53d05b2984b119d8fe820d8b8bb2b [2025-04-13 18:45:02,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:45:02,241 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:45:02,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:45:02,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:45:02,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:45:02,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@908f394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02, skipping insertion in model container [2025-04-13 18:45:02,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:45:02,432 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-send-receive.wvr.c[3146,3159] [2025-04-13 18:45:02,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:45:02,460 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:45:02,491 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-send-receive.wvr.c[3146,3159] [2025-04-13 18:45:02,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:45:02,508 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:45:02,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02 WrapperNode [2025-04-13 18:45:02,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:45:02,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:45:02,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:45:02,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:45:02,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,557 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-04-13 18:45:02,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:45:02,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:45:02,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:45:02,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:45:02,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,568 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,582 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 18:45:02,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,586 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:45:02,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:45:02,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:45:02,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:45:02,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (1/1) ... [2025-04-13 18:45:02,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:45:02,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:02,626 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 18:45:02,628 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 18:45:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:45:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:45:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:45:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:45:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:45:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:45:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:45:02,645 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:45:02,724 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:45:02,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:45:02,922 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:45:02,922 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:45:02,922 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:45:03,071 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:45:03,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:45:03 BoogieIcfgContainer [2025-04-13 18:45:03,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:45:03,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:45:03,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:45:03,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:45:03,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:45:02" (1/3) ... [2025-04-13 18:45:03,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3861c175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:45:03, skipping insertion in model container [2025-04-13 18:45:03,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:02" (2/3) ... [2025-04-13 18:45:03,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3861c175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:45:03, skipping insertion in model container [2025-04-13 18:45:03,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:45:03" (3/3) ... [2025-04-13 18:45:03,081 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-04-13 18:45:03,090 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:45:03,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 32 locations, 32 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 18:45:03,091 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:45:03,133 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:45:03,154 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2025-04-13 18:45:03,221 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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 18:45:03,245 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:45:03,254 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;@6fab9a8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:45:03,254 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:45:03,257 INFO L278 IsEmpty]: Start isEmpty. Operand has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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 18:45:03,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:45:03,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:03,270 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:03,270 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 18:45:03,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash -965839003, now seen corresponding path program 1 times [2025-04-13 18:45:03,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:03,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129980130] [2025-04-13 18:45:03,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:03,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:03,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:45:03,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:45:03,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:03,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:03,684 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 18:45:03,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:03,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129980130] [2025-04-13 18:45:03,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129980130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:03,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:03,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:45:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407284812] [2025-04-13 18:45:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:03,690 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:03,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:03,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:03,709 INFO L87 Difference]: Start difference. First operand has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:03,928 INFO L93 Difference]: Finished difference Result 681 states and 2172 transitions. [2025-04-13 18:45:03,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:03,930 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:45:03,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:03,942 INFO L225 Difference]: With dead ends: 681 [2025-04-13 18:45:03,942 INFO L226 Difference]: Without dead ends: 561 [2025-04-13 18:45:03,945 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 18:45:03,949 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:03,950 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 17 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-04-13 18:45:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 497. [2025-04-13 18:45:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 3.2278225806451615) internal successors, (1601), 496 states have internal predecessors, (1601), 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 18:45:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1601 transitions. [2025-04-13 18:45:04,038 INFO L79 Accepts]: Start accepts. Automaton has 497 states and 1601 transitions. Word has length 21 [2025-04-13 18:45:04,038 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:04,038 INFO L485 AbstractCegarLoop]: Abstraction has 497 states and 1601 transitions. [2025-04-13 18:45:04,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,039 INFO L278 IsEmpty]: Start isEmpty. Operand 497 states and 1601 transitions. [2025-04-13 18:45:04,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:45:04,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:04,041 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:04,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:45:04,041 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 18:45:04,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash -839242287, now seen corresponding path program 2 times [2025-04-13 18:45:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:04,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060171907] [2025-04-13 18:45:04,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:04,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:04,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:45:04,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:45:04,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:45:04,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:04,291 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 18:45:04,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:04,291 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060171907] [2025-04-13 18:45:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060171907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:04,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:04,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:45:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516823613] [2025-04-13 18:45:04,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:04,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:45:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:04,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:45:04,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:04,295 INFO L87 Difference]: Start difference. First operand 497 states and 1601 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:04,492 INFO L93 Difference]: Finished difference Result 841 states and 2720 transitions. [2025-04-13 18:45:04,493 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:04,493 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 18:45:04,493 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:04,497 INFO L225 Difference]: With dead ends: 841 [2025-04-13 18:45:04,497 INFO L226 Difference]: Without dead ends: 533 [2025-04-13 18:45:04,498 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:45:04,498 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 90 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:04,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 16 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:04,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-04-13 18:45:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2025-04-13 18:45:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 3.1522556390977443) internal successors, (1677), 532 states have internal predecessors, (1677), 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 18:45:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1677 transitions. [2025-04-13 18:45:04,537 INFO L79 Accepts]: Start accepts. Automaton has 533 states and 1677 transitions. Word has length 21 [2025-04-13 18:45:04,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:04,537 INFO L485 AbstractCegarLoop]: Abstraction has 533 states and 1677 transitions. [2025-04-13 18:45:04,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,537 INFO L278 IsEmpty]: Start isEmpty. Operand 533 states and 1677 transitions. [2025-04-13 18:45:04,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:45:04,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:04,541 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] [2025-04-13 18:45:04,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:45:04,541 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 18:45:04,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:04,542 INFO L85 PathProgramCache]: Analyzing trace with hash -750526206, now seen corresponding path program 1 times [2025-04-13 18:45:04,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:04,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372141469] [2025-04-13 18:45:04,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:04,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:45:04,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:45:04,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:04,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:04,618 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 18:45:04,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:04,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372141469] [2025-04-13 18:45:04,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372141469] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:04,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:45:04,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441231415] [2025-04-13 18:45:04,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:04,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:45:04,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:04,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:45:04,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:04,619 INFO L87 Difference]: Start difference. First operand 533 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:04,688 INFO L93 Difference]: Finished difference Result 873 states and 2784 transitions. [2025-04-13 18:45:04,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:45:04,688 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:45:04,688 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:04,692 INFO L225 Difference]: With dead ends: 873 [2025-04-13 18:45:04,692 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 18:45:04,695 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:04,695 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:04,695 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 19 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:04,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 18:45:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2025-04-13 18:45:04,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.1332046332046333) internal successors, (1623), 518 states have internal predecessors, (1623), 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 18:45:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1623 transitions. [2025-04-13 18:45:04,741 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1623 transitions. Word has length 24 [2025-04-13 18:45:04,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:04,741 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1623 transitions. [2025-04-13 18:45:04,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,741 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1623 transitions. [2025-04-13 18:45:04,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:45:04,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:04,742 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 18:45:04,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:45:04,743 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 18:45:04,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1052808039, now seen corresponding path program 1 times [2025-04-13 18:45:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:04,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533176030] [2025-04-13 18:45:04,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:04,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:45:04,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:45:04,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:04,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:04,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533176030] [2025-04-13 18:45:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533176030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:04,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:04,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:45:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474685685] [2025-04-13 18:45:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:04,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:04,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:04,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:04,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:04,856 INFO L87 Difference]: Start difference. First operand 519 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 18:45:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:04,943 INFO L93 Difference]: Finished difference Result 1037 states and 3245 transitions. [2025-04-13 18:45:04,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:04,944 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 18:45:04,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:04,947 INFO L225 Difference]: With dead ends: 1037 [2025-04-13 18:45:04,947 INFO L226 Difference]: Without dead ends: 520 [2025-04-13 18:45:04,948 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:04,950 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:04,950 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-04-13 18:45:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2025-04-13 18:45:04,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 519 states have (on average 3.1290944123314066) internal successors, (1624), 519 states have internal predecessors, (1624), 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 18:45:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1624 transitions. [2025-04-13 18:45:04,976 INFO L79 Accepts]: Start accepts. Automaton has 520 states and 1624 transitions. Word has length 28 [2025-04-13 18:45:04,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:04,976 INFO L485 AbstractCegarLoop]: Abstraction has 520 states and 1624 transitions. [2025-04-13 18:45:04,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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 18:45:04,976 INFO L278 IsEmpty]: Start isEmpty. Operand 520 states and 1624 transitions. [2025-04-13 18:45:04,978 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:45:04,978 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:04,978 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, 1] [2025-04-13 18:45:04,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:45:04,978 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 18:45:04,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -298854896, now seen corresponding path program 1 times [2025-04-13 18:45:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:04,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105959923] [2025-04-13 18:45:04,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:04,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:45:05,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:45:05,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:05,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:05,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:05,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105959923] [2025-04-13 18:45:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105959923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:05,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28580013] [2025-04-13 18:45:05,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:05,185 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 18:45:05,186 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 18:45:05,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:45:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:45:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:05,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:45:05,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:05,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:05,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:05,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28580013] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:05,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:05,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-04-13 18:45:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161031011] [2025-04-13 18:45:05,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:05,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:45:05,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:05,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:45:05,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:45:05,407 INFO L87 Difference]: Start difference. First operand 520 states and 1624 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 18:45:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:05,882 INFO L93 Difference]: Finished difference Result 1216 states and 3957 transitions. [2025-04-13 18:45:05,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:45:05,887 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 29 [2025-04-13 18:45:05,887 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:05,894 INFO L225 Difference]: With dead ends: 1216 [2025-04-13 18:45:05,894 INFO L226 Difference]: Without dead ends: 672 [2025-04-13 18:45:05,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:45:05,896 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 190 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:05,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 51 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:45:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-04-13 18:45:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 476. [2025-04-13 18:45:05,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.0757894736842104) internal successors, (1461), 475 states have internal predecessors, (1461), 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 18:45:05,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1461 transitions. [2025-04-13 18:45:05,929 INFO L79 Accepts]: Start accepts. Automaton has 476 states and 1461 transitions. Word has length 29 [2025-04-13 18:45:05,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:05,929 INFO L485 AbstractCegarLoop]: Abstraction has 476 states and 1461 transitions. [2025-04-13 18:45:05,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 18:45:05,929 INFO L278 IsEmpty]: Start isEmpty. Operand 476 states and 1461 transitions. [2025-04-13 18:45:05,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:45:05,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:05,930 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, 1] [2025-04-13 18:45:05,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 18:45:06,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:06,131 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 18:45:06,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 212799664, now seen corresponding path program 2 times [2025-04-13 18:45:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701791906] [2025-04-13 18:45:06,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:06,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 18:45:06,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 29 statements. [2025-04-13 18:45:06,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:45:06,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:06,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701791906] [2025-04-13 18:45:06,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701791906] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:45:06,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239965799] [2025-04-13 18:45:06,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:45:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:45:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:45:06,414 INFO L87 Difference]: Start difference. First operand 476 states and 1461 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 18:45:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,627 INFO L93 Difference]: Finished difference Result 808 states and 2519 transitions. [2025-04-13 18:45:06,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:45:06,627 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2025-04-13 18:45:06,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,631 INFO L225 Difference]: With dead ends: 808 [2025-04-13 18:45:06,631 INFO L226 Difference]: Without dead ends: 566 [2025-04-13 18:45:06,632 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:45:06,632 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 142 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,632 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 51 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-04-13 18:45:06,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-04-13 18:45:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 3.095575221238938) internal successors, (1749), 565 states have internal predecessors, (1749), 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 18:45:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1749 transitions. [2025-04-13 18:45:06,681 INFO L79 Accepts]: Start accepts. Automaton has 566 states and 1749 transitions. Word has length 29 [2025-04-13 18:45:06,681 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,681 INFO L485 AbstractCegarLoop]: Abstraction has 566 states and 1749 transitions. [2025-04-13 18:45:06,681 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 18:45:06,681 INFO L278 IsEmpty]: Start isEmpty. Operand 566 states and 1749 transitions. [2025-04-13 18:45:06,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:45:06,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,683 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:06,684 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:45:06,684 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 18:45:06,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,684 INFO L85 PathProgramCache]: Analyzing trace with hash 475648661, now seen corresponding path program 3 times [2025-04-13 18:45:06,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921406789] [2025-04-13 18:45:06,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:06,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 18:45:06,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:45:06,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:06,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:06,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921406789] [2025-04-13 18:45:06,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921406789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:45:06,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112670188] [2025-04-13 18:45:06,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:45:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:45:06,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,769 INFO L87 Difference]: Start difference. First operand 566 states and 1749 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 18:45:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,908 INFO L93 Difference]: Finished difference Result 1610 states and 5091 transitions. [2025-04-13 18:45:06,908 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:06,908 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2025-04-13 18:45:06,908 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,915 INFO L225 Difference]: With dead ends: 1610 [2025-04-13 18:45:06,915 INFO L226 Difference]: Without dead ends: 1354 [2025-04-13 18:45:06,915 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,916 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-04-13 18:45:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1086. [2025-04-13 18:45:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 1085 states have (on average 3.1271889400921657) internal successors, (3393), 1085 states have internal predecessors, (3393), 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 18:45:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 3393 transitions. [2025-04-13 18:45:06,979 INFO L79 Accepts]: Start accepts. Automaton has 1086 states and 3393 transitions. Word has length 32 [2025-04-13 18:45:06,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,979 INFO L485 AbstractCegarLoop]: Abstraction has 1086 states and 3393 transitions. [2025-04-13 18:45:06,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 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 18:45:06,979 INFO L278 IsEmpty]: Start isEmpty. Operand 1086 states and 3393 transitions. [2025-04-13 18:45:06,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:45:06,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,982 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] [2025-04-13 18:45:06,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:45:06,982 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 18:45:06,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1127614610, now seen corresponding path program 4 times [2025-04-13 18:45:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460383101] [2025-04-13 18:45:06,983 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:45:07,000 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:45:07,000 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:07,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:45:07,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:07,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460383101] [2025-04-13 18:45:07,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460383101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:07,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38930765] [2025-04-13 18:45:07,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:07,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:07,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:07,103 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 18:45:07,105 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 18:45:07,152 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 18:45:07,177 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:45:07,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:07,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:45:07,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:45:07,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:45:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38930765] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:07,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:07,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 18:45:07,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867330930] [2025-04-13 18:45:07,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:07,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:45:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:07,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:45:07,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:45:07,331 INFO L87 Difference]: Start difference. First operand 1086 states and 3393 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 18:45:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:07,598 INFO L93 Difference]: Finished difference Result 2224 states and 6964 transitions. [2025-04-13 18:45:07,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:45:07,598 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 36 [2025-04-13 18:45:07,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:07,605 INFO L225 Difference]: With dead ends: 2224 [2025-04-13 18:45:07,605 INFO L226 Difference]: Without dead ends: 1087 [2025-04-13 18:45:07,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:45:07,607 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:07,607 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 79 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-04-13 18:45:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2025-04-13 18:45:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 3.125230202578269) internal successors, (3394), 1086 states have internal predecessors, (3394), 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 18:45:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 3394 transitions. [2025-04-13 18:45:07,683 INFO L79 Accepts]: Start accepts. Automaton has 1087 states and 3394 transitions. Word has length 36 [2025-04-13 18:45:07,684 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:07,684 INFO L485 AbstractCegarLoop]: Abstraction has 1087 states and 3394 transitions. [2025-04-13 18:45:07,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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 18:45:07,684 INFO L278 IsEmpty]: Start isEmpty. Operand 1087 states and 3394 transitions. [2025-04-13 18:45:07,686 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:45:07,686 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:07,686 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-04-13 18:45:07,693 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 18:45:07,890 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,SelfDestructingSolverStorable7 [2025-04-13 18:45:07,890 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 18:45:07,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1103893115, now seen corresponding path program 5 times [2025-04-13 18:45:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:07,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660839016] [2025-04-13 18:45:07,891 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:07,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:07,897 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:45:07,909 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:07,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:07,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,993 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:07,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:07,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660839016] [2025-04-13 18:45:07,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660839016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:07,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:07,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:45:07,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580517707] [2025-04-13 18:45:07,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:07,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:07,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:07,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:07,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:07,995 INFO L87 Difference]: Start difference. First operand 1087 states and 3394 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 18:45:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:08,184 INFO L93 Difference]: Finished difference Result 2263 states and 7226 transitions. [2025-04-13 18:45:08,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:08,184 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 37 [2025-04-13 18:45:08,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:08,193 INFO L225 Difference]: With dead ends: 2263 [2025-04-13 18:45:08,193 INFO L226 Difference]: Without dead ends: 1453 [2025-04-13 18:45:08,194 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:08,195 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 38 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:08,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 46 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:08,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2025-04-13 18:45:08,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1427. [2025-04-13 18:45:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 2.9719495091164094) internal successors, (4238), 1426 states have internal predecessors, (4238), 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 18:45:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 4238 transitions. [2025-04-13 18:45:08,299 INFO L79 Accepts]: Start accepts. Automaton has 1427 states and 4238 transitions. Word has length 37 [2025-04-13 18:45:08,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:08,299 INFO L485 AbstractCegarLoop]: Abstraction has 1427 states and 4238 transitions. [2025-04-13 18:45:08,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 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 18:45:08,300 INFO L278 IsEmpty]: Start isEmpty. Operand 1427 states and 4238 transitions. [2025-04-13 18:45:08,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:45:08,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:08,302 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, 1, 1] [2025-04-13 18:45:08,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:45:08,302 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 18:45:08,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -249828293, now seen corresponding path program 1 times [2025-04-13 18:45:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:08,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188379634] [2025-04-13 18:45:08,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:08,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:45:08,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:08,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:08,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:09,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188379634] [2025-04-13 18:45:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188379634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:09,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219877912] [2025-04-13 18:45:09,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:09,248 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 18:45:09,250 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 18:45:09,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:45:09,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:09,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:09,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 18:45:09,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:09,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:09,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:10,049 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:10,050 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-13 18:45:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:10,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219877912] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:10,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:10,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 37 [2025-04-13 18:45:10,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781329265] [2025-04-13 18:45:10,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:10,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 18:45:10,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:10,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 18:45:10,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:45:10,425 INFO L87 Difference]: Start difference. First operand 1427 states and 4238 transitions. Second operand has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 37 states have internal predecessors, (96), 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 18:45:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:14,008 INFO L93 Difference]: Finished difference Result 8183 states and 24402 transitions. [2025-04-13 18:45:14,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 18:45:14,009 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 37 states have internal predecessors, (96), 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 18:45:14,009 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:14,040 INFO L225 Difference]: With dead ends: 8183 [2025-04-13 18:45:14,040 INFO L226 Difference]: Without dead ends: 5659 [2025-04-13 18:45:14,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3194 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1630, Invalid=8672, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 18:45:14,049 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 978 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 2851 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:14,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 821 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2851 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:45:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2025-04-13 18:45:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 3069. [2025-04-13 18:45:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3069 states, 3068 states have (on average 3.0140156453715776) internal successors, (9247), 3068 states have internal predecessors, (9247), 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 18:45:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3069 states to 3069 states and 9247 transitions. [2025-04-13 18:45:14,368 INFO L79 Accepts]: Start accepts. Automaton has 3069 states and 9247 transitions. Word has length 37 [2025-04-13 18:45:14,370 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:14,370 INFO L485 AbstractCegarLoop]: Abstraction has 3069 states and 9247 transitions. [2025-04-13 18:45:14,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.526315789473684) internal successors, (96), 37 states have internal predecessors, (96), 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 18:45:14,370 INFO L278 IsEmpty]: Start isEmpty. Operand 3069 states and 9247 transitions. [2025-04-13 18:45:14,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:45:14,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:14,376 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, 1, 1] [2025-04-13 18:45:14,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:14,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:14,576 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 18:45:14,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:14,577 INFO L85 PathProgramCache]: Analyzing trace with hash -26637383, now seen corresponding path program 2 times [2025-04-13 18:45:14,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:14,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457993053] [2025-04-13 18:45:14,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:14,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:45:14,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:14,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:14,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:15,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:15,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457993053] [2025-04-13 18:45:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457993053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:15,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376177710] [2025-04-13 18:45:15,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:15,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:15,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:15,309 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 18:45:15,310 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 18:45:15,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 18:45:15,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:15,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:15,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:15,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 18:45:15,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:15,877 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 18:45:15,877 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-04-13 18:45:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:15,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:16,287 INFO L325 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-04-13 18:45:16,287 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 52 [2025-04-13 18:45:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376177710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:16,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-04-13 18:45:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716367836] [2025-04-13 18:45:16,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:16,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 18:45:16,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:16,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 18:45:16,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1373, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:45:16,915 INFO L87 Difference]: Start difference. First operand 3069 states and 9247 transitions. Second operand has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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 18:45:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:23,472 INFO L93 Difference]: Finished difference Result 13926 states and 42121 transitions. [2025-04-13 18:45:23,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 18:45:23,473 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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 18:45:23,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:23,510 INFO L225 Difference]: With dead ends: 13926 [2025-04-13 18:45:23,510 INFO L226 Difference]: Without dead ends: 10692 [2025-04-13 18:45:23,518 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4842 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2773, Invalid=12233, Unknown=0, NotChecked=0, Total=15006 [2025-04-13 18:45:23,519 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 1186 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 2980 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:23,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 709 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2980 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 18:45:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10692 states. [2025-04-13 18:45:24,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10692 to 5487. [2025-04-13 18:45:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5487 states, 5486 states have (on average 3.0144002916514765) internal successors, (16537), 5486 states have internal predecessors, (16537), 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 18:45:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 16537 transitions. [2025-04-13 18:45:24,208 INFO L79 Accepts]: Start accepts. Automaton has 5487 states and 16537 transitions. Word has length 37 [2025-04-13 18:45:24,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:24,209 INFO L485 AbstractCegarLoop]: Abstraction has 5487 states and 16537 transitions. [2025-04-13 18:45:24,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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 18:45:24,209 INFO L278 IsEmpty]: Start isEmpty. Operand 5487 states and 16537 transitions. [2025-04-13 18:45:24,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:45:24,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:24,216 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2025-04-13 18:45:24,222 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 18:45:24,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:24,420 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 18:45:24,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:24,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1964538608, now seen corresponding path program 3 times [2025-04-13 18:45:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:24,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949052510] [2025-04-13 18:45:24,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:24,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:24,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:45:24,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 38 statements. [2025-04-13 18:45:24,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:24,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:24,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:45:24,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:24,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949052510] [2025-04-13 18:45:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949052510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:24,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613464635] [2025-04-13 18:45:24,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:24,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:24,680 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 18:45:24,682 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 18:45:24,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 18:45:24,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 38 statements. [2025-04-13 18:45:24,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:24,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:24,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 18:45:24,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:45:25,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:25,238 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:45:25,238 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-13 18:45:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:45:25,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613464635] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:25,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-04-13 18:45:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625831657] [2025-04-13 18:45:25,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:25,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 18:45:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:25,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 18:45:25,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:45:25,397 INFO L87 Difference]: Start difference. First operand 5487 states and 16537 transitions. Second operand has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 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 18:45:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:27,225 INFO L93 Difference]: Finished difference Result 7645 states and 22934 transitions. [2025-04-13 18:45:27,226 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:45:27,226 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 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 38 [2025-04-13 18:45:27,226 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:27,247 INFO L225 Difference]: With dead ends: 7645 [2025-04-13 18:45:27,247 INFO L226 Difference]: Without dead ends: 7227 [2025-04-13 18:45:27,249 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=490, Invalid=1862, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:45:27,249 INFO L437 NwaCegarLoop]: 26 mSDtfsCounter, 986 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:27,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 230 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:45:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7227 states. [2025-04-13 18:45:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7227 to 5631. [2025-04-13 18:45:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5631 states, 5630 states have (on average 3.0097690941385435) internal successors, (16945), 5630 states have internal predecessors, (16945), 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 18:45:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 16945 transitions. [2025-04-13 18:45:27,889 INFO L79 Accepts]: Start accepts. Automaton has 5631 states and 16945 transitions. Word has length 38 [2025-04-13 18:45:27,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:27,890 INFO L485 AbstractCegarLoop]: Abstraction has 5631 states and 16945 transitions. [2025-04-13 18:45:27,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.2413793103448274) internal successors, (94), 28 states have internal predecessors, (94), 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 18:45:27,890 INFO L278 IsEmpty]: Start isEmpty. Operand 5631 states and 16945 transitions. [2025-04-13 18:45:27,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:45:27,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:27,897 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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 18:45:27,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 18:45:28,097 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,SelfDestructingSolverStorable11 [2025-04-13 18:45:28,098 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 18:45:28,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1556594410, now seen corresponding path program 4 times [2025-04-13 18:45:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:28,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698210034] [2025-04-13 18:45:28,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:28,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:45:28,108 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:45:28,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:28,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:45:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:28,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698210034] [2025-04-13 18:45:28,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698210034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:28,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13643625] [2025-04-13 18:45:28,158 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:28,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:28,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:28,160 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 18:45:28,161 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 18:45:28,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 18:45:28,226 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:45:28,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:45:28,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:28,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:45:28,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:45:28,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:45:28,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13643625] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:28,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:28,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-13 18:45:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702673514] [2025-04-13 18:45:28,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:28,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:45:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:28,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:45:28,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:45:28,381 INFO L87 Difference]: Start difference. First operand 5631 states and 16945 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 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 18:45:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:29,764 INFO L93 Difference]: Finished difference Result 9933 states and 30297 transitions. [2025-04-13 18:45:29,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:29,764 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 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 18:45:29,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:29,790 INFO L225 Difference]: With dead ends: 9933 [2025-04-13 18:45:29,790 INFO L226 Difference]: Without dead ends: 8419 [2025-04-13 18:45:29,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:45:29,794 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 109 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:29,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8419 states. [2025-04-13 18:45:30,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8419 to 6339. [2025-04-13 18:45:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6339 states, 6338 states have (on average 3.0209845377090563) internal successors, (19147), 6338 states have internal predecessors, (19147), 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 18:45:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6339 states to 6339 states and 19147 transitions. [2025-04-13 18:45:30,539 INFO L79 Accepts]: Start accepts. Automaton has 6339 states and 19147 transitions. Word has length 40 [2025-04-13 18:45:30,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:30,539 INFO L485 AbstractCegarLoop]: Abstraction has 6339 states and 19147 transitions. [2025-04-13 18:45:30,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 9 states have internal predecessors, (67), 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 18:45:30,540 INFO L278 IsEmpty]: Start isEmpty. Operand 6339 states and 19147 transitions. [2025-04-13 18:45:30,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:45:30,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:30,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 18:45:30,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:30,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:30,747 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 18:45:30,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:30,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1558113361, now seen corresponding path program 5 times [2025-04-13 18:45:30,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:30,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027649669] [2025-04-13 18:45:30,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:30,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:30,752 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-13 18:45:30,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:45:30,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:45:30,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:30,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027649669] [2025-04-13 18:45:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027649669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:30,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335754609] [2025-04-13 18:45:30,850 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:30,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:30,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:30,853 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:30,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:45:30,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-13 18:45:30,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:45:30,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 18:45:30,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:30,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:45:30,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:31,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:31,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335754609] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:31,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-13 18:45:31,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156216043] [2025-04-13 18:45:31,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:31,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:45:31,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:45:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:45:31,099 INFO L87 Difference]: Start difference. First operand 6339 states and 19147 transitions. Second operand has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 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 18:45:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:31,590 INFO L93 Difference]: Finished difference Result 6649 states and 20005 transitions. [2025-04-13 18:45:31,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:45:31,590 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 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 44 [2025-04-13 18:45:31,590 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:31,602 INFO L225 Difference]: With dead ends: 6649 [2025-04-13 18:45:31,602 INFO L226 Difference]: Without dead ends: 2100 [2025-04-13 18:45:31,608 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:45:31,608 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:31,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 155 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-04-13 18:45:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2025-04-13 18:45:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 2.991424487851358) internal successors, (6279), 2099 states have internal predecessors, (6279), 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 18:45:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 6279 transitions. [2025-04-13 18:45:31,825 INFO L79 Accepts]: Start accepts. Automaton has 2100 states and 6279 transitions. Word has length 44 [2025-04-13 18:45:31,825 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:31,825 INFO L485 AbstractCegarLoop]: Abstraction has 2100 states and 6279 transitions. [2025-04-13 18:45:31,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0952380952380953) internal successors, (65), 20 states have internal predecessors, (65), 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 18:45:31,825 INFO L278 IsEmpty]: Start isEmpty. Operand 2100 states and 6279 transitions. [2025-04-13 18:45:31,828 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:45:31,828 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:31,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 18:45:31,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:45:32,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:32,033 INFO L403 AbstractCegarLoop]: === Iteration 15 === 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 18:45:32,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -327657610, now seen corresponding path program 6 times [2025-04-13 18:45:32,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:32,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652307211] [2025-04-13 18:45:32,034 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:45:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:32,043 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-04-13 18:45:32,064 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:45:32,064 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:45:32,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:32,830 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:32,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:32,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652307211] [2025-04-13 18:45:32,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652307211] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:32,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688120293] [2025-04-13 18:45:32,830 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:45:32,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:32,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:32,832 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:32,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:45:32,873 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-04-13 18:45:32,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:45:32,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:45:32,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:32,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 18:45:32,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:32,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:45:33,542 INFO L325 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-04-13 18:45:33,542 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-04-13 18:45:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:33,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:34,632 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 18:45:34,727 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 18:45:34,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 536 treesize of output 442 [2025-04-13 18:45:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:45:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688120293] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:36,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 49 [2025-04-13 18:45:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311231955] [2025-04-13 18:45:36,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:36,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 18:45:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:36,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 18:45:36,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2173, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:45:36,781 INFO L87 Difference]: Start difference. First operand 2100 states and 6279 transitions. Second operand has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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 18:46:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:46:18,236 INFO L93 Difference]: Finished difference Result 35322 states and 104805 transitions. [2025-04-13 18:46:18,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 363 states. [2025-04-13 18:46:18,236 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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 18:46:18,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:46:18,304 INFO L225 Difference]: With dead ends: 35322 [2025-04-13 18:46:18,304 INFO L226 Difference]: Without dead ends: 24814 [2025-04-13 18:46:18,331 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68144 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=15651, Invalid=143949, Unknown=0, NotChecked=0, Total=159600 [2025-04-13 18:46:18,332 INFO L437 NwaCegarLoop]: 125 mSDtfsCounter, 3592 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 11127 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3592 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 11588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 11127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:46:18,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3592 Valid, 2891 Invalid, 11588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 11127 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2025-04-13 18:46:18,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24814 states. [2025-04-13 18:46:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24814 to 9418. [2025-04-13 18:46:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9418 states, 9417 states have (on average 3.0362111075714133) internal successors, (28592), 9417 states have internal predecessors, (28592), 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 18:46:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9418 states to 9418 states and 28592 transitions. [2025-04-13 18:46:19,837 INFO L79 Accepts]: Start accepts. Automaton has 9418 states and 28592 transitions. Word has length 45 [2025-04-13 18:46:19,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:46:19,837 INFO L485 AbstractCegarLoop]: Abstraction has 9418 states and 28592 transitions. [2025-04-13 18:46:19,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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 18:46:19,837 INFO L278 IsEmpty]: Start isEmpty. Operand 9418 states and 28592 transitions. [2025-04-13 18:46:19,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:46:19,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:46:19,845 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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 18:46:19,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:46:20,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:46:20,046 INFO L403 AbstractCegarLoop]: === Iteration 16 === 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 18:46:20,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:46:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1697463066, now seen corresponding path program 7 times [2025-04-13 18:46:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:46:20,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740634883] [2025-04-13 18:46:20,046 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:46:20,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:46:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:46:20,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:46:20,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:20,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:46:21,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740634883] [2025-04-13 18:46:21,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740634883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:46:21,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402938885] [2025-04-13 18:46:21,169 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:46:21,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:46:21,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:46:21,171 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:46:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:46:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:46:21,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:46:21,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:46:21,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:46:21,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:46:21,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:46:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:21,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:46:22,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:46:22,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 18:46:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:46:22,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402938885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:46:22,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:46:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2025-04-13 18:46:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157035941] [2025-04-13 18:46:22,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:46:22,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 18:46:22,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:46:22,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 18:46:22,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1910, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:46:22,481 INFO L87 Difference]: Start difference. First operand 9418 states and 28592 transitions. Second operand has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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 18:47:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:22,289 INFO L93 Difference]: Finished difference Result 71056 states and 216275 transitions. [2025-04-13 18:47:22,289 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 425 states. [2025-04-13 18:47:22,289 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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 18:47:22,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:22,460 INFO L225 Difference]: With dead ends: 71056 [2025-04-13 18:47:22,460 INFO L226 Difference]: Without dead ends: 52358 [2025-04-13 18:47:22,504 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 459 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92692 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=22616, Invalid=189444, Unknown=0, NotChecked=0, Total=212060 [2025-04-13 18:47:22,504 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 2774 mSDsluCounter, 2469 mSDsCounter, 0 mSdLazyCounter, 10400 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2774 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 10844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 10400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:22,505 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2774 Valid, 2558 Invalid, 10844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 10400 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-04-13 18:47:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52358 states. [2025-04-13 18:47:27,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52358 to 22250. [2025-04-13 18:47:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22250 states, 22249 states have (on average 3.0410355521596477) internal successors, (67660), 22249 states have internal predecessors, (67660), 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 18:47:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22250 states to 22250 states and 67660 transitions. [2025-04-13 18:47:27,270 INFO L79 Accepts]: Start accepts. Automaton has 22250 states and 67660 transitions. Word has length 45 [2025-04-13 18:47:27,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:27,270 INFO L485 AbstractCegarLoop]: Abstraction has 22250 states and 67660 transitions. [2025-04-13 18:47:27,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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 18:47:27,270 INFO L278 IsEmpty]: Start isEmpty. Operand 22250 states and 67660 transitions. [2025-04-13 18:47:27,283 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 18:47:27,283 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:27,283 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 18:47:27,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 18:47:27,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:47:27,484 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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 18:47:27,484 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -302784051, now seen corresponding path program 8 times [2025-04-13 18:47:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:27,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534274103] [2025-04-13 18:47:27,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:47:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:27,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 18:47:27,515 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:47:27,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:47:27,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:47:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:28,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534274103] [2025-04-13 18:47:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534274103] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:28,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425539186] [2025-04-13 18:47:28,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:47:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:28,617 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:47:28,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 18:47:28,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-04-13 18:47:28,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:47:28,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:47:28,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:28,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:47:28,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:29,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:47:29,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:29,391 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:29,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 18:47:29,551 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:47:29,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425539186] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:29,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:29,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 12] total 41 [2025-04-13 18:47:29,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266059015] [2025-04-13 18:47:29,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:29,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:47:29,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:29,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:47:29,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1507, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:47:29,552 INFO L87 Difference]: Start difference. First operand 22250 states and 67660 transitions. Second operand has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 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 18:47:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:47:42,535 INFO L93 Difference]: Finished difference Result 32686 states and 98572 transitions. [2025-04-13 18:47:42,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 18:47:42,535 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 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 46 [2025-04-13 18:47:42,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:47:42,637 INFO L225 Difference]: With dead ends: 32686 [2025-04-13 18:47:42,637 INFO L226 Difference]: Without dead ends: 31246 [2025-04-13 18:47:42,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1650, Invalid=10122, Unknown=0, NotChecked=0, Total=11772 [2025-04-13 18:47:42,647 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 1687 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:47:42,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 769 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:47:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31246 states. [2025-04-13 18:47:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31246 to 22932. [2025-04-13 18:47:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22932 states, 22931 states have (on average 3.03715494309014) internal successors, (69645), 22931 states have internal predecessors, (69645), 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 18:47:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22932 states to 22932 states and 69645 transitions. [2025-04-13 18:47:47,154 INFO L79 Accepts]: Start accepts. Automaton has 22932 states and 69645 transitions. Word has length 46 [2025-04-13 18:47:47,154 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:47:47,154 INFO L485 AbstractCegarLoop]: Abstraction has 22932 states and 69645 transitions. [2025-04-13 18:47:47,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.880952380952381) internal successors, (121), 41 states have internal predecessors, (121), 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 18:47:47,155 INFO L278 IsEmpty]: Start isEmpty. Operand 22932 states and 69645 transitions. [2025-04-13 18:47:47,171 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 18:47:47,171 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:47:47,171 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 18:47:47,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 18:47:47,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 18:47:47,372 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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 18:47:47,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:47:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1948130387, now seen corresponding path program 9 times [2025-04-13 18:47:47,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:47:47,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-13 18:47:47,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:47:47,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:47:47,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 3 equivalence classes. [2025-04-13 18:47:47,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:47:47,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:47:47,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:47,824 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:47:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:47:47,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104217478] [2025-04-13 18:47:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104217478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:47:47,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490492126] [2025-04-13 18:47:47,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:47:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:47:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:47:47,826 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:47:47,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 18:47:47,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 3 equivalence classes. [2025-04-13 18:47:47,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:47:47,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:47:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:47:47,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 18:47:47,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:47:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:47:48,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:47:48,510 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:47:48,510 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 18:47:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:47:48,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490492126] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:47:48,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:47:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 12] total 34 [2025-04-13 18:47:48,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141511212] [2025-04-13 18:47:48,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:47:48,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 18:47:48,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:47:48,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 18:47:48,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=988, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:47:48,670 INFO L87 Difference]: Start difference. First operand 22932 states and 69645 transitions. Second operand has 35 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 34 states have internal predecessors, (118), 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 18:48:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:48:05,545 INFO L93 Difference]: Finished difference Result 41646 states and 126557 transitions. [2025-04-13 18:48:05,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 18:48:05,546 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 34 states have internal predecessors, (118), 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 46 [2025-04-13 18:48:05,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:48:05,657 INFO L225 Difference]: With dead ends: 41646 [2025-04-13 18:48:05,657 INFO L226 Difference]: Without dead ends: 38624 [2025-04-13 18:48:05,671 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1861, Invalid=7841, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 18:48:05,671 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 964 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:48:05,671 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 726 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 18:48:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38624 states. [2025-04-13 18:48:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38624 to 25560. [2025-04-13 18:48:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25560 states, 25559 states have (on average 3.0314566297585976) internal successors, (77481), 25559 states have internal predecessors, (77481), 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 18:48:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25560 states to 25560 states and 77481 transitions. [2025-04-13 18:48:10,808 INFO L79 Accepts]: Start accepts. Automaton has 25560 states and 77481 transitions. Word has length 46 [2025-04-13 18:48:10,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:48:10,808 INFO L485 AbstractCegarLoop]: Abstraction has 25560 states and 77481 transitions. [2025-04-13 18:48:10,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.3714285714285714) internal successors, (118), 34 states have internal predecessors, (118), 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 18:48:10,808 INFO L278 IsEmpty]: Start isEmpty. Operand 25560 states and 77481 transitions. [2025-04-13 18:48:10,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-13 18:48:10,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:48:10,823 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 18:48:10,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 18:48:11,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 18:48:11,024 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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 18:48:11,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:48:11,024 INFO L85 PathProgramCache]: Analyzing trace with hash 424343611, now seen corresponding path program 10 times [2025-04-13 18:48:11,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:48:11,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178279854] [2025-04-13 18:48:11,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:48:11,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:48:11,029 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 18:48:11,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:48:11,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:48:11,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:11,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:48:11,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:48:11,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178279854] [2025-04-13 18:48:11,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178279854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:48:11,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880917392] [2025-04-13 18:48:11,310 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:48:11,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:48:11,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:48:11,312 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:48:11,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 18:48:11,355 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-04-13 18:48:11,374 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-04-13 18:48:11,374 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:48:11,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:11,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:48:11,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:48:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:48:11,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:48:11,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:48:11,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 18:48:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:48:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880917392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:48:11,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:48:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 30 [2025-04-13 18:48:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301427760] [2025-04-13 18:48:11,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:48:11,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 18:48:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:48:11,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 18:48:11,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=784, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:48:11,943 INFO L87 Difference]: Start difference. First operand 25560 states and 77481 transitions. Second operand has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 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 18:48:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:48:40,423 INFO L93 Difference]: Finished difference Result 54426 states and 166632 transitions. [2025-04-13 18:48:40,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2025-04-13 18:48:40,423 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 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 46 [2025-04-13 18:48:40,424 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:48:40,597 INFO L225 Difference]: With dead ends: 54426 [2025-04-13 18:48:40,598 INFO L226 Difference]: Without dead ends: 50240 [2025-04-13 18:48:40,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15428 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4139, Invalid=33303, Unknown=0, NotChecked=0, Total=37442 [2025-04-13 18:48:40,616 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 2544 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2544 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:48:40,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2544 Valid, 673 Invalid, 4397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 18:48:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50240 states. [2025-04-13 18:48:46,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50240 to 25406. [2025-04-13 18:48:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25406 states, 25405 states have (on average 3.024640818736469) internal successors, (76841), 25405 states have internal predecessors, (76841), 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 18:48:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25406 states to 25406 states and 76841 transitions. [2025-04-13 18:48:46,715 INFO L79 Accepts]: Start accepts. Automaton has 25406 states and 76841 transitions. Word has length 46 [2025-04-13 18:48:46,715 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:48:46,715 INFO L485 AbstractCegarLoop]: Abstraction has 25406 states and 76841 transitions. [2025-04-13 18:48:46,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.903225806451613) internal successors, (121), 30 states have internal predecessors, (121), 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 18:48:46,715 INFO L278 IsEmpty]: Start isEmpty. Operand 25406 states and 76841 transitions. [2025-04-13 18:48:46,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:48:46,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:48:46,738 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 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 18:48:46,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 18:48:46,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:48:46,938 INFO L403 AbstractCegarLoop]: === Iteration 20 === 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 18:48:46,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:48:46,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1645439727, now seen corresponding path program 11 times [2025-04-13 18:48:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:48:46,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265061565] [2025-04-13 18:48:46,939 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:48:46,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:48:46,944 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-13 18:48:46,952 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:48:46,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:48:46,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 18:48:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:48:47,012 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265061565] [2025-04-13 18:48:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265061565] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:48:47,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243169856] [2025-04-13 18:48:47,013 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:48:47,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:48:47,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:48:47,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:48:47,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 18:48:47,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-13 18:48:47,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:48:47,093 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:48:47,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:48:47,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:48:47,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:48:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 18:48:47,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:48:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 18:48:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243169856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:48:47,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:48:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 12 [2025-04-13 18:48:47,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722578174] [2025-04-13 18:48:47,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:48:47,274 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:48:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:48:47,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:48:47,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:48:47,274 INFO L87 Difference]: Start difference. First operand 25406 states and 76841 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 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 18:49:00,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:49:00,158 INFO L93 Difference]: Finished difference Result 40492 states and 123077 transitions. [2025-04-13 18:49:00,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:49:00,158 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 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 50 [2025-04-13 18:49:00,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:49:00,289 INFO L225 Difference]: With dead ends: 40492 [2025-04-13 18:49:00,290 INFO L226 Difference]: Without dead ends: 37880 [2025-04-13 18:49:00,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:49:00,305 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 177 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:49:00,305 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 68 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:49:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37880 states. [2025-04-13 18:49:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37880 to 35232. [2025-04-13 18:49:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35232 states, 35231 states have (on average 3.023672334024013) internal successors, (106527), 35231 states have internal predecessors, (106527), 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 18:49:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35232 states to 35232 states and 106527 transitions. [2025-04-13 18:49:08,838 INFO L79 Accepts]: Start accepts. Automaton has 35232 states and 106527 transitions. Word has length 50 [2025-04-13 18:49:08,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:49:08,838 INFO L485 AbstractCegarLoop]: Abstraction has 35232 states and 106527 transitions. [2025-04-13 18:49:08,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 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 18:49:08,838 INFO L278 IsEmpty]: Start isEmpty. Operand 35232 states and 106527 transitions. [2025-04-13 18:49:08,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-13 18:49:08,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:49:08,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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 18:49:08,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 18:49:09,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-04-13 18:49:09,065 INFO L403 AbstractCegarLoop]: === Iteration 21 === 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 18:49:09,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:49:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1572355322, now seen corresponding path program 12 times [2025-04-13 18:49:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:49:09,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501980674] [2025-04-13 18:49:09,065 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:49:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:49:09,070 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:49:09,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:49:09,088 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:49:09,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:49:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:49:10,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501980674] [2025-04-13 18:49:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501980674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:49:10,274 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062391584] [2025-04-13 18:49:10,274 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:49:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:49:10,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:49:10,276 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:49:10,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 18:49:10,322 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 50 statements into 3 equivalence classes. [2025-04-13 18:49:10,350 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 18:49:10,350 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:49:10,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:49:10,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-04-13 18:49:10,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:49:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:49:11,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:49:11,570 INFO L325 Elim1Store]: treesize reduction 30, result has 64.7 percent of original size [2025-04-13 18:49:11,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 84 [2025-04-13 18:49:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:49:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062391584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:49:12,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:49:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 50 [2025-04-13 18:49:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101788964] [2025-04-13 18:49:12,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:49:12,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-13 18:49:12,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:49:12,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-13 18:49:12,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=2165, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:49:12,015 INFO L87 Difference]: Start difference. First operand 35232 states and 106527 transitions. Second operand has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 50 states have internal predecessors, (136), 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 18:50:21,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:50:21,415 INFO L93 Difference]: Finished difference Result 130049 states and 398150 transitions. [2025-04-13 18:50:21,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2025-04-13 18:50:21,416 INFO L79 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 50 states have internal predecessors, (136), 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 50 [2025-04-13 18:50:21,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:50:21,896 INFO L225 Difference]: With dead ends: 130049 [2025-04-13 18:50:21,896 INFO L226 Difference]: Without dead ends: 111675 [2025-04-13 18:50:21,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28022 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=12239, Invalid=57721, Unknown=0, NotChecked=0, Total=69960 [2025-04-13 18:50:21,970 INFO L437 NwaCegarLoop]: 75 mSDtfsCounter, 2108 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 5955 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2108 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 6214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 5955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:50:21,971 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2108 Valid, 1442 Invalid, 6214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 5955 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 18:50:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111675 states. [2025-04-13 18:50:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111675 to 70550. [2025-04-13 18:50:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70550 states, 70549 states have (on average 3.0343165742958793) internal successors, (214068), 70549 states have internal predecessors, (214068), 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 18:50:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70550 states to 70550 states and 214068 transitions. [2025-04-13 18:50:43,519 INFO L79 Accepts]: Start accepts. Automaton has 70550 states and 214068 transitions. Word has length 50 [2025-04-13 18:50:43,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:50:43,519 INFO L485 AbstractCegarLoop]: Abstraction has 70550 states and 214068 transitions. [2025-04-13 18:50:43,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.6666666666666665) internal successors, (136), 50 states have internal predecessors, (136), 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 18:50:43,519 INFO L278 IsEmpty]: Start isEmpty. Operand 70550 states and 214068 transitions. [2025-04-13 18:50:43,570 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-04-13 18:50:43,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:50:43,570 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 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 18:50:43,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 18:50:43,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:50:43,771 INFO L403 AbstractCegarLoop]: === Iteration 22 === 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 18:50:43,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:50:43,771 INFO L85 PathProgramCache]: Analyzing trace with hash -474442841, now seen corresponding path program 13 times [2025-04-13 18:50:43,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:50:43,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017549158] [2025-04-13 18:50:43,771 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:50:43,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:50:43,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:50:43,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:50:43,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:43,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:50:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:50:45,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017549158] [2025-04-13 18:50:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017549158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:50:45,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231441074] [2025-04-13 18:50:45,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:50:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:50:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:50:45,997 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:50:45,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 18:50:46,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-04-13 18:50:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 18:50:46,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:50:46,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:50:46,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 18:50:46,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:50:46,469 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:50:46,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:50:46,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:50:46,805 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 18:50:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 18:50:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231441074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:50:46,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:50:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 11] total 41 [2025-04-13 18:50:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756755525] [2025-04-13 18:50:46,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:50:46,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 18:50:46,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:50:46,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 18:50:46,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1552, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 18:50:46,981 INFO L87 Difference]: Start difference. First operand 70550 states and 214068 transitions. Second operand has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 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 18:51:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:29,769 INFO L93 Difference]: Finished difference Result 96564 states and 291700 transitions. [2025-04-13 18:51:29,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 18:51:29,770 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 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 51 [2025-04-13 18:51:29,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:30,173 INFO L225 Difference]: With dead ends: 96564 [2025-04-13 18:51:30,173 INFO L226 Difference]: Without dead ends: 95042 [2025-04-13 18:51:30,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1533, Invalid=10023, Unknown=0, NotChecked=0, Total=11556 [2025-04-13 18:51:30,209 INFO L437 NwaCegarLoop]: 50 mSDtfsCounter, 1394 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:30,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 960 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 18:51:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2025-04-13 18:51:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 70748. [2025-04-13 18:51:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70748 states, 70747 states have (on average 3.0338812953199428) internal successors, (214638), 70747 states have internal predecessors, (214638), 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 18:51:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70748 states to 70748 states and 214638 transitions. [2025-04-13 18:51:51,083 INFO L79 Accepts]: Start accepts. Automaton has 70748 states and 214638 transitions. Word has length 51 [2025-04-13 18:51:51,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:51,084 INFO L485 AbstractCegarLoop]: Abstraction has 70748 states and 214638 transitions. [2025-04-13 18:51:51,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.2142857142857144) internal successors, (135), 41 states have internal predecessors, (135), 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 18:51:51,084 INFO L278 IsEmpty]: Start isEmpty. Operand 70748 states and 214638 transitions. [2025-04-13 18:51:51,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:51:51,132 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:51,132 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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 18:51:51,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 18:51:51,333 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:51,333 INFO L403 AbstractCegarLoop]: === Iteration 23 === 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 18:51:51,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2036639682, now seen corresponding path program 14 times [2025-04-13 18:51:51,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:51,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506841114] [2025-04-13 18:51:51,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:51,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:51:51,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:51:51,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:51,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:51:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:51,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506841114] [2025-04-13 18:51:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506841114] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:51:51,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071570229] [2025-04-13 18:51:51,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:51:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:51,477 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:51:51,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 18:51:51,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:51:51,545 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:51:51,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:51:51,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:51,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 18:51:51,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:51:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:51:51,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:51:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:51:52,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071570229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:51:52,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:51:52,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2025-04-13 18:51:52,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517035673] [2025-04-13 18:51:52,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:51:52,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:51:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:52,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:51:52,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=787, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:51:52,040 INFO L87 Difference]: Start difference. First operand 70748 states and 214638 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 18:52:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:13,170 INFO L93 Difference]: Finished difference Result 108034 states and 327695 transitions. [2025-04-13 18:52:13,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:52:13,170 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 52 [2025-04-13 18:52:13,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:13,351 INFO L225 Difference]: With dead ends: 108034 [2025-04-13 18:52:13,351 INFO L226 Difference]: Without dead ends: 29182 [2025-04-13 18:52:13,438 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=625, Invalid=1537, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:52:13,438 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 440 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:13,438 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 375 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:52:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29182 states. [2025-04-13 18:52:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29182 to 24048. [2025-04-13 18:52:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24048 states, 24047 states have (on average 3.021250051981536) internal successors, (72652), 24047 states have internal predecessors, (72652), 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 18:52:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24048 states to 24048 states and 72652 transitions. [2025-04-13 18:52:22,315 INFO L79 Accepts]: Start accepts. Automaton has 24048 states and 72652 transitions. Word has length 52 [2025-04-13 18:52:22,315 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:22,315 INFO L485 AbstractCegarLoop]: Abstraction has 24048 states and 72652 transitions. [2025-04-13 18:52:22,315 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 18:52:22,315 INFO L278 IsEmpty]: Start isEmpty. Operand 24048 states and 72652 transitions. [2025-04-13 18:52:22,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:52:22,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:22,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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 18:52:22,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 18:52:22,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 18:52:22,537 INFO L403 AbstractCegarLoop]: === Iteration 24 === 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 18:52:22,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:22,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1349416102, now seen corresponding path program 15 times [2025-04-13 18:52:22,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:22,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304387660] [2025-04-13 18:52:22,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:22,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:22,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-04-13 18:52:22,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 52 statements. [2025-04-13 18:52:22,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:52:22,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:52:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:22,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304387660] [2025-04-13 18:52:22,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304387660] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:22,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104106453] [2025-04-13 18:52:22,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:52:22,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:22,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:22,674 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:52:22,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 18:52:22,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 4 equivalence classes. [2025-04-13 18:52:22,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 48 of 52 statements. [2025-04-13 18:52:22,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 18:52:22,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:22,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 18:52:22,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:23,011 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:52:23,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:52:23,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104106453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:23,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:23,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2025-04-13 18:52:23,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765497025] [2025-04-13 18:52:23,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:23,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:52:23,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:23,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:52:23,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:52:23,250 INFO L87 Difference]: Start difference. First operand 24048 states and 72652 transitions. Second operand has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 18:52:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:35,529 INFO L93 Difference]: Finished difference Result 25354 states and 76356 transitions. [2025-04-13 18:52:35,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:52:35,530 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 52 [2025-04-13 18:52:35,530 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:35,684 INFO L225 Difference]: With dead ends: 25354 [2025-04-13 18:52:35,684 INFO L226 Difference]: Without dead ends: 23754 [2025-04-13 18:52:35,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=1033, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:52:35,697 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 219 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:35,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 399 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2025-04-13 18:52:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 22972. [2025-04-13 18:52:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22972 states, 22971 states have (on average 3.0224195725044622) internal successors, (69428), 22971 states have internal predecessors, (69428), 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 18:52:43,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22972 states to 22972 states and 69428 transitions. [2025-04-13 18:52:43,591 INFO L79 Accepts]: Start accepts. Automaton has 22972 states and 69428 transitions. Word has length 52 [2025-04-13 18:52:43,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:52:43,591 INFO L485 AbstractCegarLoop]: Abstraction has 22972 states and 69428 transitions. [2025-04-13 18:52:43,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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 18:52:43,592 INFO L278 IsEmpty]: Start isEmpty. Operand 22972 states and 69428 transitions. [2025-04-13 18:52:43,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-04-13 18:52:43,612 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:52:43,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 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 18:52:43,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 18:52:43,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:43,813 INFO L403 AbstractCegarLoop]: === Iteration 25 === 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 18:52:43,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:52:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 512501054, now seen corresponding path program 16 times [2025-04-13 18:52:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:52:43,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703386909] [2025-04-13 18:52:43,813 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:52:43,818 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:52:43,823 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:52:43,823 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:43,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:43,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 18:52:43,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:52:43,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703386909] [2025-04-13 18:52:43,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703386909] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:52:43,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611183072] [2025-04-13 18:52:43,930 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:52:43,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:52:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:52:43,932 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:52:43,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 18:52:43,986 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-04-13 18:52:44,011 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-04-13 18:52:44,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:52:44,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:52:44,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 18:52:44,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:52:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:52:44,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:52:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:52:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611183072] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:52:44,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:52:44,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2025-04-13 18:52:44,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003114566] [2025-04-13 18:52:44,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:52:44,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:52:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:52:44,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:52:44,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:52:44,503 INFO L87 Difference]: Start difference. First operand 22972 states and 69428 transitions. Second operand has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 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 18:52:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:52:54,556 INFO L93 Difference]: Finished difference Result 23130 states and 69854 transitions. [2025-04-13 18:52:54,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:52:54,557 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 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 52 [2025-04-13 18:52:54,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:52:54,673 INFO L225 Difference]: With dead ends: 23130 [2025-04-13 18:52:54,673 INFO L226 Difference]: Without dead ends: 21979 [2025-04-13 18:52:54,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=692, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:52:54,680 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:52:54,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 305 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:52:54,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21979 states. [2025-04-13 18:53:01,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21979 to 21979. [2025-04-13 18:53:01,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21979 states, 21978 states have (on average 3.0363090363090364) internal successors, (66732), 21978 states have internal predecessors, (66732), 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 18:53:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21979 states to 21979 states and 66732 transitions. [2025-04-13 18:53:01,925 INFO L79 Accepts]: Start accepts. Automaton has 21979 states and 66732 transitions. Word has length 52 [2025-04-13 18:53:01,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:53:01,926 INFO L485 AbstractCegarLoop]: Abstraction has 21979 states and 66732 transitions. [2025-04-13 18:53:01,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.285714285714286) internal successors, (120), 27 states have internal predecessors, (120), 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 18:53:01,926 INFO L278 IsEmpty]: Start isEmpty. Operand 21979 states and 66732 transitions. [2025-04-13 18:53:01,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 18:53:01,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:53:01,950 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 18:53:01,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 18:53:02,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:02,150 INFO L403 AbstractCegarLoop]: === Iteration 26 === 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 18:53:02,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:53:02,151 INFO L85 PathProgramCache]: Analyzing trace with hash -609313579, now seen corresponding path program 17 times [2025-04-13 18:53:02,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:53:02,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303385650] [2025-04-13 18:53:02,151 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:53:02,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 4 equivalence classes. [2025-04-13 18:53:02,172 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:53:02,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:53:02,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:53:03,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303385650] [2025-04-13 18:53:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303385650] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:53:03,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698153784] [2025-04-13 18:53:03,332 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:53:03,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:53:03,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:53:03,334 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:53:03,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 18:53:03,384 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 4 equivalence classes. [2025-04-13 18:53:03,410 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:53:03,410 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 18:53:03,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:53:03,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 18:53:03,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:53:04,580 INFO L325 Elim1Store]: treesize reduction 129, result has 7.2 percent of original size [2025-04-13 18:53:04,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 83 treesize of output 33 [2025-04-13 18:53:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:04,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:53:05,567 INFO L325 Elim1Store]: treesize reduction 48, result has 76.1 percent of original size [2025-04-13 18:53:05,567 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 140 treesize of output 190 [2025-04-13 18:53:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:53:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698153784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:53:07,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:53:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 63 [2025-04-13 18:53:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861850846] [2025-04-13 18:53:07,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:53:07,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-04-13 18:53:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:53:07,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-04-13 18:53:07,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=3511, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 18:53:07,190 INFO L87 Difference]: Start difference. First operand 21979 states and 66732 transitions. Second operand has 64 states, 64 states have (on average 2.265625) internal successors, (145), 63 states have internal predecessors, (145), 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 18:55:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:55:55,346 INFO L93 Difference]: Finished difference Result 117119 states and 352421 transitions. [2025-04-13 18:55:55,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 493 states. [2025-04-13 18:55:55,346 INFO L79 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.265625) internal successors, (145), 63 states have internal predecessors, (145), 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 53 [2025-04-13 18:55:55,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:55:55,763 INFO L225 Difference]: With dead ends: 117119 [2025-04-13 18:55:55,763 INFO L226 Difference]: Without dead ends: 97121 [2025-04-13 18:55:55,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127782 ImplicationChecksByTransitivity, 47.2s TimeCoverageRelationStatistics Valid=41617, Invalid=253775, Unknown=0, NotChecked=0, Total=295392 [2025-04-13 18:55:55,827 INFO L437 NwaCegarLoop]: 206 mSDtfsCounter, 1557 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 17779 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 4084 SdHoareTripleChecker+Invalid, 17968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 17779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:55:55,828 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 4084 Invalid, 17968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [189 Valid, 17779 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2025-04-13 18:55:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97121 states. [2025-04-13 18:56:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97121 to 41935. [2025-04-13 18:56:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41935 states, 41934 states have (on average 3.0673916153956218) internal successors, (128628), 41934 states have internal predecessors, (128628), 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 18:56:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41935 states to 41935 states and 128628 transitions. [2025-04-13 18:56:13,054 INFO L79 Accepts]: Start accepts. Automaton has 41935 states and 128628 transitions. Word has length 53 [2025-04-13 18:56:13,054 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:56:13,054 INFO L485 AbstractCegarLoop]: Abstraction has 41935 states and 128628 transitions. [2025-04-13 18:56:13,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.265625) internal successors, (145), 63 states have internal predecessors, (145), 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 18:56:13,055 INFO L278 IsEmpty]: Start isEmpty. Operand 41935 states and 128628 transitions. [2025-04-13 18:56:13,087 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-13 18:56:13,087 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:56:13,087 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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 18:56:13,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-04-13 18:56:13,287 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:13,288 INFO L403 AbstractCegarLoop]: === Iteration 27 === 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 18:56:13,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:56:13,288 INFO L85 PathProgramCache]: Analyzing trace with hash 981337555, now seen corresponding path program 18 times [2025-04-13 18:56:13,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:56:13,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017413286] [2025-04-13 18:56:13,288 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:13,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:56:13,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 4 equivalence classes. [2025-04-13 18:56:13,307 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:56:13,307 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 18:56:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:14,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:56:14,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017413286] [2025-04-13 18:56:14,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017413286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:56:14,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100671712] [2025-04-13 18:56:14,457 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:56:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:56:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:56:14,459 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:56:14,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 18:56:14,515 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 4 equivalence classes. [2025-04-13 18:56:14,589 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 53 of 53 statements. [2025-04-13 18:56:14,590 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 18:56:14,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:56:14,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-04-13 18:56:14,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:56:15,795 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:15,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:56:16,779 INFO L325 Elim1Store]: treesize reduction 78, result has 56.9 percent of original size [2025-04-13 18:56:16,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 142 treesize of output 140 [2025-04-13 18:56:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:56:18,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100671712] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:56:18,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:56:18,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 59 [2025-04-13 18:56:18,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565548608] [2025-04-13 18:56:18,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:56:18,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-04-13 18:56:18,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:56:18,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-04-13 18:56:18,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=648, Invalid=2892, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 18:56:18,408 INFO L87 Difference]: Start difference. First operand 41935 states and 128628 transitions. Second operand has 60 states, 60 states have (on average 2.4166666666666665) internal successors, (145), 59 states have internal predecessors, (145), 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) Received shutdown request... [2025-04-13 18:58:47,476 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:58:47,477 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 440 states. [2025-04-13 18:58:47,480 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:58:47,485 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115212 ImplicationChecksByTransitivity, 80.3s TimeCoverageRelationStatistics Valid=37075, Invalid=205481, Unknown=0, NotChecked=0, Total=242556 [2025-04-13 18:58:47,485 INFO L437 NwaCegarLoop]: 95 mSDtfsCounter, 5696 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 6602 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5696 SdHoareTripleChecker+Valid, 1953 SdHoareTripleChecker+Invalid, 7613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 6602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:58:47,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5696 Valid, 1953 Invalid, 7613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 6602 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-04-13 18:58:47,486 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:58:47,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 18:58:47,687 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 18:58:47,687 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (41935states) and FLOYD_HOARE automaton (currently 440 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (83426 states constructed, input type IntersectNwa). [2025-04-13 18:58:47,689 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:58:47,689 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:58:47,689 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:58:47,691 INFO L422 BasicCegarLoop]: Path program histogram: [18, 5, 2, 1, 1] [2025-04-13 18:58:47,693 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:58:47,693 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:58:47,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:58:47 BasicIcfg [2025-04-13 18:58:47,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:58:47,694 INFO L158 Benchmark]: Toolchain (without parser) took 825453.82ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 97.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-04-13 18:58:47,694 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:58:47,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.77ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 82.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:58:47,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:58:47,695 INFO L158 Benchmark]: Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:58:47,695 INFO L158 Benchmark]: RCFGBuilder took 474.39ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 33.4MB in the end (delta: 45.2MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 18:58:47,695 INFO L158 Benchmark]: TraceAbstraction took 824620.70ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 33.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 18:58:47,696 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.15ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.77ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 82.8MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 39.18ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 78.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 474.39ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 33.4MB in the end (delta: 45.2MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * TraceAbstraction took 824620.70ms. Allocated memory was 142.6MB in the beginning and 3.5GB in the end (delta: 3.4GB). Free memory was 33.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 2.5GB. 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 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (41935states) and FLOYD_HOARE automaton (currently 440 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (83426 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (41935states) and FLOYD_HOARE automaton (currently 440 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (83426 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (41935states) and FLOYD_HOARE automaton (currently 440 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (83426 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (41935states) and FLOYD_HOARE automaton (currently 440 states, 60 states before enhancement),while ReachableStatesComputation was computing reachable states (83426 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 53 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 824.5s, OverallIterations: 27, TraceHistogramMax: 5, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.4s, AutomataDifference: 664.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27107 SdHoareTripleChecker+Valid, 50.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27107 mSDsluCounter, 19523 SdHoareTripleChecker+Invalid, 44.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18343 mSDsCounter, 2973 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 75249 IncrementalHoareTripleChecker+Invalid, 78222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2973 mSolverCounterUnsat, 1180 mSDtfsCounter, 75249 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4520 GetRequests, 1382 SyntacticMatches, 3 SemanticMatches, 3135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467201 ImplicationChecksByTransitivity, 214.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70748occurred in iteration=22, InterpolantAutomatonStates: 2236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 116.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 232910 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 36.1s InterpolantComputationTime, 1996 NumberOfCodeBlocks, 1985 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 2831 ConstructedInterpolants, 80 QuantifiedInterpolants, 56208 SizeOfPredicates, 178 NumberOfNonLiveVariables, 4923 ConjunctsInSsa, 632 ConjunctsInUnsatCore, 67 InterpolantComputations, 7 PerfectInterpolantSequences, 546/1545 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown