/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-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:21:35,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:21:35,067 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:21:35,072 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:21:35,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:21:35,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:21:35,090 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:21:35,090 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:21:35,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:21:35,090 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:21:35,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:21:35,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:21:35,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:21:35,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:21:35,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:21:35,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:21:35,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:21:35,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:21:35,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:21:35,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:21:35,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:21:35,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:21:35,093 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:21:35,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:21:35,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:21:35,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:21:35,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:21:35,283 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:21:35,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-13 18:21:36,584 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e529b37/7d7d4b2302044176a3a1aaf7865131f7/FLAG129f93342 [2025-04-13 18:21:36,770 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:21:36,770 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2025-04-13 18:21:36,779 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e529b37/7d7d4b2302044176a3a1aaf7865131f7/FLAG129f93342 [2025-04-13 18:21:37,584 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0e529b37/7d7d4b2302044176a3a1aaf7865131f7 [2025-04-13 18:21:37,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:21:37,588 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:21:37,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:21:37,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:21:37,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:21:37,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aaca644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37, skipping insertion in model container [2025-04-13 18:21:37,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:21:37,756 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-more-array-sum.wvr.c[2423,2436] [2025-04-13 18:21:37,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:21:37,781 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:21:37,817 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-more-array-sum.wvr.c[2423,2436] [2025-04-13 18:21:37,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:21:37,835 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:21:37,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37 WrapperNode [2025-04-13 18:21:37,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:21:37,838 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:21:37,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:21:37,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:21:37,843 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:21:37" (1/1) ... [2025-04-13 18:21:37,855 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:21:37" (1/1) ... [2025-04-13 18:21:37,881 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 249 [2025-04-13 18:21:37,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:21:37,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:21:37,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:21:37,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:21:37,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,906 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:21:37,906 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,912 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:21:37,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:21:37,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:21:37,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:21:37,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (1/1) ... [2025-04-13 18:21:37,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:21:37,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:37,949 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:21:37,954 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:21:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:21:37,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:21:37,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:21:37,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:21:37,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:21:37,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:21:37,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:21:37,974 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:21:38,062 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:21:38,063 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:21:38,415 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:21:38,416 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:21:38,416 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:21:38,736 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:21:38,740 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:21:38,744 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:21:38,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:21:38 BoogieIcfgContainer [2025-04-13 18:21:38,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:21:38,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:21:38,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:21:38,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:21:38,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:21:37" (1/3) ... [2025-04-13 18:21:38,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9aec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:21:38, skipping insertion in model container [2025-04-13 18:21:38,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:21:37" (2/3) ... [2025-04-13 18:21:38,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e9aec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:21:38, skipping insertion in model container [2025-04-13 18:21:38,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:21:38" (3/3) ... [2025-04-13 18:21:38,750 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-04-13 18:21:38,761 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:21:38,762 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:21:38,762 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:21:38,801 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:21:38,820 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 18:21:38,845 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 152 states, 151 states have (on average 3.622516556291391) internal successors, (547), 151 states have internal predecessors, (547), 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:21:38,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:21:38,875 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;@1ea9083c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:21:38,875 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:21:38,878 INFO L278 IsEmpty]: Start isEmpty. Operand has 152 states, 151 states have (on average 3.622516556291391) internal successors, (547), 151 states have internal predecessors, (547), 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:21:38,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 18:21:38,887 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:38,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:38,887 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:21:38,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1844238436, now seen corresponding path program 1 times [2025-04-13 18:21:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:38,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735937797] [2025-04-13 18:21:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:38,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 18:21:38,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 18:21:38,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:38,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:39,140 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:21:39,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:39,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735937797] [2025-04-13 18:21:39,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735937797] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:39,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:21:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616906899] [2025-04-13 18:21:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:39,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:21:39,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:39,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:21:39,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:21:39,168 INFO L87 Difference]: Start difference. First operand has 152 states, 151 states have (on average 3.622516556291391) internal successors, (547), 151 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:39,230 INFO L93 Difference]: Finished difference Result 183 states and 625 transitions. [2025-04-13 18:21:39,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:21:39,232 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 18:21:39,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:39,239 INFO L225 Difference]: With dead ends: 183 [2025-04-13 18:21:39,239 INFO L226 Difference]: Without dead ends: 152 [2025-04-13 18:21:39,243 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:21:39,245 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:39,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:21:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-04-13 18:21:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-04-13 18:21:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 3.4304635761589406) internal successors, (518), 151 states have internal predecessors, (518), 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:21:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 518 transitions. [2025-04-13 18:21:39,285 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 518 transitions. Word has length 17 [2025-04-13 18:21:39,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:39,286 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 518 transitions. [2025-04-13 18:21:39,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:39,286 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 518 transitions. [2025-04-13 18:21:39,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 18:21:39,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:39,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:39,288 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:21:39,288 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:21:39,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash 234189092, now seen corresponding path program 1 times [2025-04-13 18:21:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:39,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730104859] [2025-04-13 18:21:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 18:21:39,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 18:21:39,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:39,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:39,519 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:21:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:39,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730104859] [2025-04-13 18:21:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730104859] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:39,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:21:39,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123881819] [2025-04-13 18:21:39,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:39,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:21:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:39,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:21:39,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:21:39,520 INFO L87 Difference]: Start difference. First operand 152 states and 518 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:39,609 INFO L93 Difference]: Finished difference Result 305 states and 1039 transitions. [2025-04-13 18:21:39,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:21:39,610 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 18:21:39,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:39,611 INFO L225 Difference]: With dead ends: 305 [2025-04-13 18:21:39,611 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 18:21:39,612 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:21:39,612 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:39,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:21:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 18:21:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-04-13 18:21:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 3.3986928104575163) internal successors, (520), 153 states have internal predecessors, (520), 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:21:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 520 transitions. [2025-04-13 18:21:39,630 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 520 transitions. Word has length 19 [2025-04-13 18:21:39,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:39,630 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 520 transitions. [2025-04-13 18:21:39,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:39,630 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 520 transitions. [2025-04-13 18:21:39,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 18:21:39,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:39,631 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:21:39,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:21:39,631 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:21:39,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash 17419156, now seen corresponding path program 1 times [2025-04-13 18:21:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:39,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223628204] [2025-04-13 18:21:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:39,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:21:39,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:21:39,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:39,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:39,797 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:21:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:39,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223628204] [2025-04-13 18:21:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223628204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:39,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701510839] [2025-04-13 18:21:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:39,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:39,800 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:21:39,801 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:21:39,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 18:21:39,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 18:21:39,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:39,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:39,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 18:21:39,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:39,961 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:21:39,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701510839] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:21:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 18:21:39,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939176840] [2025-04-13 18:21:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:39,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:21:39,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:39,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:21:39,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:39,998 INFO L87 Difference]: Start difference. First operand 154 states and 520 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:21:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:40,068 INFO L93 Difference]: Finished difference Result 260 states and 882 transitions. [2025-04-13 18:21:40,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:21:40,068 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:21:40,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:40,070 INFO L225 Difference]: With dead ends: 260 [2025-04-13 18:21:40,070 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 18:21:40,071 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:21:40,071 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:40,071 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 6 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:21:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 18:21:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-04-13 18:21:40,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 3.4358974358974357) internal successors, (670), 195 states have internal predecessors, (670), 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:21:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 670 transitions. [2025-04-13 18:21:40,084 INFO L79 Accepts]: Start accepts. Automaton has 196 states and 670 transitions. Word has length 21 [2025-04-13 18:21:40,085 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:40,085 INFO L485 AbstractCegarLoop]: Abstraction has 196 states and 670 transitions. [2025-04-13 18:21:40,085 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:21:40,085 INFO L278 IsEmpty]: Start isEmpty. Operand 196 states and 670 transitions. [2025-04-13 18:21:40,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:40,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:40,086 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:40,092 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:21:40,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:40,287 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:21:40,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:40,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1138876813, now seen corresponding path program 1 times [2025-04-13 18:21:40,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:40,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349140419] [2025-04-13 18:21:40,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:40,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:40,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:21:40,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:40,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:40,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:41,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349140419] [2025-04-13 18:21:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349140419] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:41,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472322452] [2025-04-13 18:21:41,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:41,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:41,403 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:21:41,405 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:21:41,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:21:41,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:41,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:41,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:41,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:21:41,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:41,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:21:41,546 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 15 treesize of output 1 [2025-04-13 18:21:41,577 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:21:41,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:21:41,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:21:41,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:21:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:41,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:42,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472322452] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:42,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 23 [2025-04-13 18:21:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602836266] [2025-04-13 18:21:42,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:42,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:21:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:42,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:21:42,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:21:42,021 INFO L87 Difference]: Start difference. First operand 196 states and 670 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 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:21:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:42,951 INFO L93 Difference]: Finished difference Result 388 states and 1248 transitions. [2025-04-13 18:21:42,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 18:21:42,952 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:42,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:42,954 INFO L225 Difference]: With dead ends: 388 [2025-04-13 18:21:42,954 INFO L226 Difference]: Without dead ends: 382 [2025-04-13 18:21:42,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=238, Invalid=1322, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:21:42,955 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 174 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:42,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 12 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-04-13 18:21:42,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 231. [2025-04-13 18:21:42,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 3.3391304347826085) internal successors, (768), 230 states have internal predecessors, (768), 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:21:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 768 transitions. [2025-04-13 18:21:42,974 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 768 transitions. Word has length 22 [2025-04-13 18:21:42,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:42,974 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 768 transitions. [2025-04-13 18:21:42,975 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 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:21:42,975 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 768 transitions. [2025-04-13 18:21:42,976 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:42,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:42,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:42,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 18:21:43,176 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,SelfDestructingSolverStorable3 [2025-04-13 18:21:43,177 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:21:43,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:43,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1060006989, now seen corresponding path program 2 times [2025-04-13 18:21:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:43,177 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349802867] [2025-04-13 18:21:43,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:43,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:43,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:43,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:43,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:43,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:43,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349802867] [2025-04-13 18:21:43,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349802867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:43,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424862053] [2025-04-13 18:21:43,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:43,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:43,629 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:21:43,631 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:21:43,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:43,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:43,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:43,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:43,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:21:43,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:43,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:43,839 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:21:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:43,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:43,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:43,916 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 41 treesize of output 86 [2025-04-13 18:21:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:44,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424862053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:44,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:44,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2025-04-13 18:21:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393412938] [2025-04-13 18:21:44,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:44,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 18:21:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:44,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 18:21:44,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:21:44,067 INFO L87 Difference]: Start difference. First operand 231 states and 768 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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:21:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:44,396 INFO L93 Difference]: Finished difference Result 343 states and 1090 transitions. [2025-04-13 18:21:44,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 18:21:44,396 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:44,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:44,398 INFO L225 Difference]: With dead ends: 343 [2025-04-13 18:21:44,398 INFO L226 Difference]: Without dead ends: 337 [2025-04-13 18:21:44,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:21:44,399 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:44,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 7 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:21:44,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-04-13 18:21:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 241. [2025-04-13 18:21:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 3.3) internal successors, (792), 240 states have internal predecessors, (792), 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:21:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 792 transitions. [2025-04-13 18:21:44,423 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 792 transitions. Word has length 22 [2025-04-13 18:21:44,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:44,424 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 792 transitions. [2025-04-13 18:21:44,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 16 states have internal predecessors, (43), 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:21:44,424 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 792 transitions. [2025-04-13 18:21:44,425 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:44,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:44,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:44,431 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:21:44,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:44,626 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:21:44,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash -498375429, now seen corresponding path program 3 times [2025-04-13 18:21:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:44,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571853307] [2025-04-13 18:21:44,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:44,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:44,663 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:44,663 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:21:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:45,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:45,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571853307] [2025-04-13 18:21:45,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571853307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:45,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903065112] [2025-04-13 18:21:45,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:45,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:45,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:45,156 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:21:45,157 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:21:45,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:45,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:45,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:21:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:45,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:21:45,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:45,378 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 18:21:45,378 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 31 treesize of output 43 [2025-04-13 18:21:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:45,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:45,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:45,482 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 41 treesize of output 86 [2025-04-13 18:21:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903065112] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:45,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 16 [2025-04-13 18:21:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517674698] [2025-04-13 18:21:45,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:45,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:21:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:45,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:21:45,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:21:45,639 INFO L87 Difference]: Start difference. First operand 241 states and 792 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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:21:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:46,508 INFO L93 Difference]: Finished difference Result 768 states and 2499 transitions. [2025-04-13 18:21:46,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:21:46,509 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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 22 [2025-04-13 18:21:46,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:46,513 INFO L225 Difference]: With dead ends: 768 [2025-04-13 18:21:46,513 INFO L226 Difference]: Without dead ends: 762 [2025-04-13 18:21:46,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1216, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:21:46,514 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 223 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:46,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 11 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:21:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-04-13 18:21:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 256. [2025-04-13 18:21:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 3.3529411764705883) internal successors, (855), 255 states have internal predecessors, (855), 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:21:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 855 transitions. [2025-04-13 18:21:46,537 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 855 transitions. Word has length 22 [2025-04-13 18:21:46,537 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:46,538 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 855 transitions. [2025-04-13 18:21:46,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 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:21:46,538 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 855 transitions. [2025-04-13 18:21:46,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:46,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:46,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:46,546 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:21:46,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:46,741 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:21:46,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash -627415125, now seen corresponding path program 4 times [2025-04-13 18:21:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:46,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62745437] [2025-04-13 18:21:46,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:46,747 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:46,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:46,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:46,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:47,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:47,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62745437] [2025-04-13 18:21:47,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62745437] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:47,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178877457] [2025-04-13 18:21:47,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:47,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:47,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:47,267 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:21:47,269 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:21:47,313 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:47,333 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:47,333 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:47,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:47,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:21:47,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:47,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:21:47,357 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 15 treesize of output 1 [2025-04-13 18:21:47,378 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:21:47,378 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:21:47,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:21:47,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:21:47,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:47,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:47,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178877457] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:47,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:47,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-13 18:21:47,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691232459] [2025-04-13 18:21:47,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:47,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:21:47,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:47,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:21:47,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:21:47,685 INFO L87 Difference]: Start difference. First operand 256 states and 855 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:21:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:48,841 INFO L93 Difference]: Finished difference Result 645 states and 2178 transitions. [2025-04-13 18:21:48,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:21:48,841 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:48,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:48,845 INFO L225 Difference]: With dead ends: 645 [2025-04-13 18:21:48,845 INFO L226 Difference]: Without dead ends: 572 [2025-04-13 18:21:48,846 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:21:48,848 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 202 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:48,848 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 33 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-04-13 18:21:48,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 319. [2025-04-13 18:21:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.3773584905660377) internal successors, (1074), 318 states have internal predecessors, (1074), 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:21:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1074 transitions. [2025-04-13 18:21:48,877 INFO L79 Accepts]: Start accepts. Automaton has 319 states and 1074 transitions. Word has length 22 [2025-04-13 18:21:48,877 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:48,877 INFO L485 AbstractCegarLoop]: Abstraction has 319 states and 1074 transitions. [2025-04-13 18:21:48,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:21:48,879 INFO L278 IsEmpty]: Start isEmpty. Operand 319 states and 1074 transitions. [2025-04-13 18:21:48,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:48,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:48,880 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:48,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:21:49,080 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:49,080 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:21:49,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:49,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1550616867, now seen corresponding path program 5 times [2025-04-13 18:21:49,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:49,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101222540] [2025-04-13 18:21:49,081 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:49,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:49,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:49,111 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:49,111 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:49,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:49,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101222540] [2025-04-13 18:21:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101222540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:49,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612176283] [2025-04-13 18:21:49,403 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:49,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:49,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:49,405 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:21:49,406 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:21:49,454 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:49,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:49,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:49,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:49,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:21:49,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:49,513 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 15 treesize of output 1 [2025-04-13 18:21:49,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:49,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-04-13 18:21:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:49,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:49,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612176283] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:49,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:49,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 19 [2025-04-13 18:21:49,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166989229] [2025-04-13 18:21:49,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:49,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:21:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:49,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:21:49,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:21:49,749 INFO L87 Difference]: Start difference. First operand 319 states and 1074 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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:21:50,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:50,172 INFO L93 Difference]: Finished difference Result 461 states and 1473 transitions. [2025-04-13 18:21:50,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:21:50,173 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:50,173 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:50,176 INFO L225 Difference]: With dead ends: 461 [2025-04-13 18:21:50,176 INFO L226 Difference]: Without dead ends: 455 [2025-04-13 18:21:50,176 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:21:50,177 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 116 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:50,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 8 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:21:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-04-13 18:21:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 319. [2025-04-13 18:21:50,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.3773584905660377) internal successors, (1074), 318 states have internal predecessors, (1074), 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:21:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1074 transitions. [2025-04-13 18:21:50,208 INFO L79 Accepts]: Start accepts. Automaton has 319 states and 1074 transitions. Word has length 22 [2025-04-13 18:21:50,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:50,208 INFO L485 AbstractCegarLoop]: Abstraction has 319 states and 1074 transitions. [2025-04-13 18:21:50,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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:21:50,208 INFO L278 IsEmpty]: Start isEmpty. Operand 319 states and 1074 transitions. [2025-04-13 18:21:50,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:50,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:50,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:50,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:21:50,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:50,413 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:21:50,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:50,413 INFO L85 PathProgramCache]: Analyzing trace with hash 526294255, now seen corresponding path program 6 times [2025-04-13 18:21:50,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:50,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293061123] [2025-04-13 18:21:50,413 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:50,420 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:50,430 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:50,431 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:21:50,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:50,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:50,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293061123] [2025-04-13 18:21:50,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293061123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:50,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633188680] [2025-04-13 18:21:50,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:50,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:50,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:50,762 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:21:50,764 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:21:50,809 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:50,829 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:50,829 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:21:50,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:21:50,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:50,996 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:50,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:21:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:51,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:51,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:51,086 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 41 treesize of output 86 [2025-04-13 18:21:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633188680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:51,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 18:21:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277601868] [2025-04-13 18:21:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:51,243 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:21:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:51,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:21:51,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:21:51,244 INFO L87 Difference]: Start difference. First operand 319 states and 1074 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:21:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:51,834 INFO L93 Difference]: Finished difference Result 666 states and 2174 transitions. [2025-04-13 18:21:51,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:21:51,834 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:51,834 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:51,837 INFO L225 Difference]: With dead ends: 666 [2025-04-13 18:21:51,837 INFO L226 Difference]: Without dead ends: 655 [2025-04-13 18:21:51,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:21:51,838 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:51,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 15 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:21:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-04-13 18:21:51,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 323. [2025-04-13 18:21:51,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.37888198757764) internal successors, (1088), 322 states have internal predecessors, (1088), 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:21:51,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1088 transitions. [2025-04-13 18:21:51,870 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 1088 transitions. Word has length 22 [2025-04-13 18:21:51,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:51,871 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 1088 transitions. [2025-04-13 18:21:51,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:21:51,871 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 1088 transitions. [2025-04-13 18:21:51,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:51,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:51,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:51,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 18:21:52,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:52,072 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:21:52,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1607042557, now seen corresponding path program 7 times [2025-04-13 18:21:52,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:52,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111172515] [2025-04-13 18:21:52,073 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:52,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:52,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:21:52,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:52,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:52,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:52,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:52,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:52,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111172515] [2025-04-13 18:21:52,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111172515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:52,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290552230] [2025-04-13 18:21:52,518 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:52,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:52,520 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:21:52,521 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:21:52,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:21:52,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:52,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:52,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:52,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:21:52,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:52,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:21:52,610 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 15 treesize of output 1 [2025-04-13 18:21:52,642 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:21:52,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:21:52,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:21:52,840 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:21:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:52,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290552230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:53,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 7] total 26 [2025-04-13 18:21:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607184562] [2025-04-13 18:21:53,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:53,001 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:21:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:53,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:21:53,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:21:53,002 INFO L87 Difference]: Start difference. First operand 323 states and 1088 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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:21:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:54,260 INFO L93 Difference]: Finished difference Result 846 states and 2805 transitions. [2025-04-13 18:21:54,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:21:54,260 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:54,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:54,264 INFO L225 Difference]: With dead ends: 846 [2025-04-13 18:21:54,264 INFO L226 Difference]: Without dead ends: 840 [2025-04-13 18:21:54,265 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=392, Invalid=2158, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:21:54,265 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 169 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:54,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 19 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-04-13 18:21:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 327. [2025-04-13 18:21:54,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 3.392638036809816) internal successors, (1106), 326 states have internal predecessors, (1106), 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:21:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1106 transitions. [2025-04-13 18:21:54,308 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 1106 transitions. Word has length 22 [2025-04-13 18:21:54,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:54,308 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 1106 transitions. [2025-04-13 18:21:54,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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:21:54,309 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 1106 transitions. [2025-04-13 18:21:54,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:54,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:54,309 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:54,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 18:21:54,514 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,SelfDestructingSolverStorable9 [2025-04-13 18:21:54,514 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:21:54,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1162111445, now seen corresponding path program 8 times [2025-04-13 18:21:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:54,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28683253] [2025-04-13 18:21:54,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:54,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:54,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:54,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:54,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:55,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28683253] [2025-04-13 18:21:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28683253] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:55,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386577361] [2025-04-13 18:21:55,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:55,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:55,007 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:21:55,009 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:21:55,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:55,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:55,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:55,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:55,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:21:55,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:55,242 INFO L325 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-04-13 18:21:55,243 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 31 treesize of output 43 [2025-04-13 18:21:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:55,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:55,327 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:55,327 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 41 treesize of output 86 [2025-04-13 18:21:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:55,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386577361] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:55,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:55,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 6] total 18 [2025-04-13 18:21:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071012536] [2025-04-13 18:21:55,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:55,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 18:21:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:55,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 18:21:55,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:21:55,425 INFO L87 Difference]: Start difference. First operand 327 states and 1106 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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:21:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:56,535 INFO L93 Difference]: Finished difference Result 891 states and 2964 transitions. [2025-04-13 18:21:56,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:21:56,535 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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 22 [2025-04-13 18:21:56,535 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:56,539 INFO L225 Difference]: With dead ends: 891 [2025-04-13 18:21:56,539 INFO L226 Difference]: Without dead ends: 885 [2025-04-13 18:21:56,539 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=319, Invalid=1241, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 18:21:56,539 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:56,540 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 19 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-04-13 18:21:56,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 327. [2025-04-13 18:21:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 3.392638036809816) internal successors, (1106), 326 states have internal predecessors, (1106), 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:21:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 1106 transitions. [2025-04-13 18:21:56,578 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 1106 transitions. Word has length 22 [2025-04-13 18:21:56,578 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:56,578 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 1106 transitions. [2025-04-13 18:21:56,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 19 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:21:56,578 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 1106 transitions. [2025-04-13 18:21:56,579 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:56,579 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:56,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:56,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 18:21:56,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:56,779 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:21:56,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:56,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1688792907, now seen corresponding path program 9 times [2025-04-13 18:21:56,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:56,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508639376] [2025-04-13 18:21:56,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:56,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:56,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:56,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:56,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:21:56,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:57,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:57,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:57,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508639376] [2025-04-13 18:21:57,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508639376] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:57,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379564264] [2025-04-13 18:21:57,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:57,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:57,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:57,049 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:21:57,051 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:21:57,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:57,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:57,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:21:57,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:57,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:21:57,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:57,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:57,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:21:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:57,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:57,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:21:57,319 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 33 treesize of output 78 [2025-04-13 18:21:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379564264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:57,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 18:21:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921374486] [2025-04-13 18:21:57,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:57,415 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:21:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:57,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:21:57,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:21:57,415 INFO L87 Difference]: Start difference. First operand 327 states and 1106 transitions. Second operand has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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:21:57,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:57,790 INFO L93 Difference]: Finished difference Result 448 states and 1457 transitions. [2025-04-13 18:21:57,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:21:57,790 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:21:57,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:57,792 INFO L225 Difference]: With dead ends: 448 [2025-04-13 18:21:57,792 INFO L226 Difference]: Without dead ends: 442 [2025-04-13 18:21:57,792 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:21:57,793 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 52 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:57,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 6 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:21:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-04-13 18:21:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 337. [2025-04-13 18:21:57,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.363095238095238) internal successors, (1130), 336 states have internal predecessors, (1130), 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:21:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1130 transitions. [2025-04-13 18:21:57,841 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 1130 transitions. Word has length 22 [2025-04-13 18:21:57,842 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:57,842 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 1130 transitions. [2025-04-13 18:21:57,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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:21:57,842 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 1130 transitions. [2025-04-13 18:21:57,842 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:21:57,842 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:57,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:21:57,848 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:21:58,043 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,SelfDestructingSolverStorable11 [2025-04-13 18:21:58,043 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:21:58,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2118905267, now seen corresponding path program 10 times [2025-04-13 18:21:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:58,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848084229] [2025-04-13 18:21:58,043 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:58,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:58,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:58,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:58,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:58,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:58,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848084229] [2025-04-13 18:21:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848084229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:21:58,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988415157] [2025-04-13 18:21:58,533 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:58,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:21:58,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:21:58,535 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:21:58,551 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:21:58,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:21:58,621 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:21:58,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:58,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:21:58,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:21:58,629 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:21:58,652 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 15 treesize of output 1 [2025-04-13 18:21:58,677 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:21:58,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:21:58,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:21:58,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:21:58,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:21:58,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:21:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:21:58,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988415157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:21:58,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:21:58,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 25 [2025-04-13 18:21:58,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377474903] [2025-04-13 18:21:58,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:21:58,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:21:58,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:58,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:21:58,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:21:58,956 INFO L87 Difference]: Start difference. First operand 337 states and 1130 transitions. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:00,548 INFO L93 Difference]: Finished difference Result 536 states and 1795 transitions. [2025-04-13 18:22:00,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:22:00,548 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:00,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:00,550 INFO L225 Difference]: With dead ends: 536 [2025-04-13 18:22:00,550 INFO L226 Difference]: Without dead ends: 530 [2025-04-13 18:22:00,551 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=361, Invalid=2089, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:22:00,551 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 107 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:00,552 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 36 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-04-13 18:22:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 365. [2025-04-13 18:22:00,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.4038461538461537) internal successors, (1239), 364 states have internal predecessors, (1239), 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:22:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1239 transitions. [2025-04-13 18:22:00,600 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1239 transitions. Word has length 22 [2025-04-13 18:22:00,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:00,601 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1239 transitions. [2025-04-13 18:22:00,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:00,601 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1239 transitions. [2025-04-13 18:22:00,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:00,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:00,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:00,607 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:22:00,806 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,SelfDestructingSolverStorable12 [2025-04-13 18:22:00,806 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:22:00,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash 325841803, now seen corresponding path program 11 times [2025-04-13 18:22:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:00,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703100188] [2025-04-13 18:22:00,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:00,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:00,817 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:00,817 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:00,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:01,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:01,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703100188] [2025-04-13 18:22:01,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703100188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:01,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686206425] [2025-04-13 18:22:01,065 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:01,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:01,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:01,067 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:22:01,068 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:22:01,115 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:01,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:01,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:01,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:01,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 18:22:01,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:01,169 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 15 treesize of output 1 [2025-04-13 18:22:01,261 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:01,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-04-13 18:22:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:01,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686206425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:01,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:01,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 19 [2025-04-13 18:22:01,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509434086] [2025-04-13 18:22:01,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:01,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:22:01,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:01,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:22:01,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:22:01,365 INFO L87 Difference]: Start difference. First operand 365 states and 1239 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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:22:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:01,739 INFO L93 Difference]: Finished difference Result 472 states and 1553 transitions. [2025-04-13 18:22:01,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 18:22:01,742 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:01,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:01,745 INFO L225 Difference]: With dead ends: 472 [2025-04-13 18:22:01,745 INFO L226 Difference]: Without dead ends: 466 [2025-04-13 18:22:01,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:01,745 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 64 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:01,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:01,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-04-13 18:22:01,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 365. [2025-04-13 18:22:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.4038461538461537) internal successors, (1239), 364 states have internal predecessors, (1239), 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:22:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1239 transitions. [2025-04-13 18:22:01,795 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1239 transitions. Word has length 22 [2025-04-13 18:22:01,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:01,795 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1239 transitions. [2025-04-13 18:22:01,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 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:22:01,795 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1239 transitions. [2025-04-13 18:22:01,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:01,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:01,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:01,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:01,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 18:22:01,996 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:22:01,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:01,996 INFO L85 PathProgramCache]: Analyzing trace with hash 399697183, now seen corresponding path program 12 times [2025-04-13 18:22:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:01,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414188418] [2025-04-13 18:22:01,997 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:02,001 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:02,009 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:02,009 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:02,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:02,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:02,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414188418] [2025-04-13 18:22:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414188418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:02,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415532367] [2025-04-13 18:22:02,246 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:02,249 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:22:02,251 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:22:02,299 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:02,317 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:02,317 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:02,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:02,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:22:02,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:02,443 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:02,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:22:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:02,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:02,505 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:02,506 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 41 treesize of output 86 [2025-04-13 18:22:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:02,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415532367] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:02,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:02,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 18:22:02,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245058312] [2025-04-13 18:22:02,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:02,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:22:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:02,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:22:02,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:22:02,662 INFO L87 Difference]: Start difference. First operand 365 states and 1239 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:22:03,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:03,044 INFO L93 Difference]: Finished difference Result 460 states and 1517 transitions. [2025-04-13 18:22:03,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 18:22:03,044 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:03,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:03,046 INFO L225 Difference]: With dead ends: 460 [2025-04-13 18:22:03,046 INFO L226 Difference]: Without dead ends: 454 [2025-04-13 18:22:03,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:22:03,049 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 56 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:03,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 8 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-04-13 18:22:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 369. [2025-04-13 18:22:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 3.391304347826087) internal successors, (1248), 368 states have internal predecessors, (1248), 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:22:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 1248 transitions. [2025-04-13 18:22:03,119 INFO L79 Accepts]: Start accepts. Automaton has 369 states and 1248 transitions. Word has length 22 [2025-04-13 18:22:03,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:03,119 INFO L485 AbstractCegarLoop]: Abstraction has 369 states and 1248 transitions. [2025-04-13 18:22:03,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:22:03,119 INFO L278 IsEmpty]: Start isEmpty. Operand 369 states and 1248 transitions. [2025-04-13 18:22:03,120 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:03,120 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:03,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:03,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:03,320 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,SelfDestructingSolverStorable14 [2025-04-13 18:22:03,320 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:22:03,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:03,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2089292175, now seen corresponding path program 13 times [2025-04-13 18:22:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:03,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295964054] [2025-04-13 18:22:03,321 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:03,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:03,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:03,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:03,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:03,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:03,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295964054] [2025-04-13 18:22:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295964054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:03,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363864600] [2025-04-13 18:22:03,523 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:03,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:03,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:03,525 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:22:03,526 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:22:03,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:03,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:03,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:03,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:03,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:22:03,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:03,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:03,618 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 15 treesize of output 1 [2025-04-13 18:22:03,636 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:03,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:03,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:03,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:03,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:03,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:03,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363864600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:03,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 21 [2025-04-13 18:22:03,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63014912] [2025-04-13 18:22:03,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:03,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 18:22:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 18:22:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-04-13 18:22:03,843 INFO L87 Difference]: Start difference. First operand 369 states and 1248 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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:22:04,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:04,308 INFO L93 Difference]: Finished difference Result 480 states and 1561 transitions. [2025-04-13 18:22:04,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 18:22:04,308 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:04,308 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:04,310 INFO L225 Difference]: With dead ends: 480 [2025-04-13 18:22:04,310 INFO L226 Difference]: Without dead ends: 474 [2025-04-13 18:22:04,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:04,311 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 90 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:04,311 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 6 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:22:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-04-13 18:22:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 365. [2025-04-13 18:22:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 3.4038461538461537) internal successors, (1239), 364 states have internal predecessors, (1239), 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:22:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1239 transitions. [2025-04-13 18:22:04,365 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1239 transitions. Word has length 22 [2025-04-13 18:22:04,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:04,365 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1239 transitions. [2025-04-13 18:22:04,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 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:22:04,365 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1239 transitions. [2025-04-13 18:22:04,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:04,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:04,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:04,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:04,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:04,566 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:22:04,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:04,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1808601847, now seen corresponding path program 14 times [2025-04-13 18:22:04,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:04,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946927262] [2025-04-13 18:22:04,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:04,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:04,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:04,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:04,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:04,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:04,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:04,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:04,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946927262] [2025-04-13 18:22:04,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946927262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:04,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293086581] [2025-04-13 18:22:04,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:04,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:04,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:04,794 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:22:04,795 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:22:04,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:04,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:04,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:04,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:04,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:22:04,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:04,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:04,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:22:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:04,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:05,035 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:05,035 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 33 treesize of output 78 [2025-04-13 18:22:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293086581] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:05,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:05,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 16 [2025-04-13 18:22:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410584805] [2025-04-13 18:22:05,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:05,148 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:22:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:05,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:22:05,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:22:05,149 INFO L87 Difference]: Start difference. First operand 365 states and 1239 transitions. Second operand has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:22:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:05,800 INFO L93 Difference]: Finished difference Result 697 states and 2314 transitions. [2025-04-13 18:22:05,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:22:05,800 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:05,800 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:05,803 INFO L225 Difference]: With dead ends: 697 [2025-04-13 18:22:05,803 INFO L226 Difference]: Without dead ends: 686 [2025-04-13 18:22:05,804 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:05,804 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:05,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 11 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2025-04-13 18:22:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 367. [2025-04-13 18:22:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.398907103825137) internal successors, (1244), 366 states have internal predecessors, (1244), 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:22:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1244 transitions. [2025-04-13 18:22:05,859 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1244 transitions. Word has length 22 [2025-04-13 18:22:05,859 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:05,859 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1244 transitions. [2025-04-13 18:22:05,860 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 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:22:05,860 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1244 transitions. [2025-04-13 18:22:05,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:05,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:05,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:05,866 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:22:06,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 18:22:06,061 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:22:06,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1303197805, now seen corresponding path program 15 times [2025-04-13 18:22:06,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:06,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313064370] [2025-04-13 18:22:06,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:06,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:06,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:06,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:06,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:06,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:06,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:06,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313064370] [2025-04-13 18:22:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313064370] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:06,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797042353] [2025-04-13 18:22:06,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:06,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:06,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:06,486 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:22:06,487 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:22:06,537 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:06,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:06,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:06,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:06,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:22:06,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:06,683 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:06,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:22:06,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:06,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:06,765 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:06,766 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 33 treesize of output 78 [2025-04-13 18:22:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:06,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797042353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:06,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:06,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 20 [2025-04-13 18:22:06,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860342209] [2025-04-13 18:22:06,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:06,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:22:06,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:06,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:22:06,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:22:06,836 INFO L87 Difference]: Start difference. First operand 367 states and 1244 transitions. Second operand has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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:22:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:07,564 INFO L93 Difference]: Finished difference Result 686 states and 2296 transitions. [2025-04-13 18:22:07,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:22:07,564 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:07,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:07,567 INFO L225 Difference]: With dead ends: 686 [2025-04-13 18:22:07,567 INFO L226 Difference]: Without dead ends: 680 [2025-04-13 18:22:07,567 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=975, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:22:07,568 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 91 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:07,568 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 15 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:22:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-04-13 18:22:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 367. [2025-04-13 18:22:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 3.398907103825137) internal successors, (1244), 366 states have internal predecessors, (1244), 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:22:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1244 transitions. [2025-04-13 18:22:07,630 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1244 transitions. Word has length 22 [2025-04-13 18:22:07,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:07,630 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1244 transitions. [2025-04-13 18:22:07,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 21 states have internal predecessors, (48), 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:22:07,630 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1244 transitions. [2025-04-13 18:22:07,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:07,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:07,637 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:22:07,835 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,SelfDestructingSolverStorable17 [2025-04-13 18:22:07,835 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:22:07,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:07,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1123414345, now seen corresponding path program 16 times [2025-04-13 18:22:07,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:07,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754721397] [2025-04-13 18:22:07,835 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:07,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:07,839 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:07,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:07,846 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:07,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:08,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754721397] [2025-04-13 18:22:08,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754721397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:08,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253472036] [2025-04-13 18:22:08,178 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:08,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:08,180 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:22:08,181 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:22:08,228 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:08,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:08,248 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:08,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:08,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:22:08,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:08,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:08,282 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 15 treesize of output 1 [2025-04-13 18:22:08,304 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:08,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:08,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:08,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:08,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:08,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253472036] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:08,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 7] total 24 [2025-04-13 18:22:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422454769] [2025-04-13 18:22:08,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:08,530 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:22:08,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:08,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:22:08,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:22:08,531 INFO L87 Difference]: Start difference. First operand 367 states and 1244 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:22:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:09,838 INFO L93 Difference]: Finished difference Result 939 states and 3278 transitions. [2025-04-13 18:22:09,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:22:09,839 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:09,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:09,843 INFO L225 Difference]: With dead ends: 939 [2025-04-13 18:22:09,843 INFO L226 Difference]: Without dead ends: 933 [2025-04-13 18:22:09,844 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=2235, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:22:09,844 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 214 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:09,844 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 53 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-04-13 18:22:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 381. [2025-04-13 18:22:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 3.418421052631579) internal successors, (1299), 380 states have internal predecessors, (1299), 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:22:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1299 transitions. [2025-04-13 18:22:09,919 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1299 transitions. Word has length 22 [2025-04-13 18:22:09,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:09,919 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1299 transitions. [2025-04-13 18:22:09,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:22:09,919 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1299 transitions. [2025-04-13 18:22:09,920 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:09,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:09,928 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:22:10,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:10,121 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:22:10,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1629824443, now seen corresponding path program 17 times [2025-04-13 18:22:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:10,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647229228] [2025-04-13 18:22:10,121 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:10,125 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:10,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:10,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:10,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:10,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647229228] [2025-04-13 18:22:10,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647229228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:10,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198797547] [2025-04-13 18:22:10,334 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:10,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:10,336 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:22:10,337 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:22:10,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:10,399 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:10,399 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:10,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:22:10,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:10,415 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:10,429 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 15 treesize of output 1 [2025-04-13 18:22:10,444 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:10,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:10,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:10,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:10,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:10,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:10,705 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:10,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198797547] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:10,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:10,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 23 [2025-04-13 18:22:10,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186314666] [2025-04-13 18:22:10,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:10,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:22:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:10,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:22:10,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:22:10,706 INFO L87 Difference]: Start difference. First operand 381 states and 1299 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 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:22:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:11,848 INFO L93 Difference]: Finished difference Result 861 states and 2870 transitions. [2025-04-13 18:22:11,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:11,849 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:11,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:11,852 INFO L225 Difference]: With dead ends: 861 [2025-04-13 18:22:11,852 INFO L226 Difference]: Without dead ends: 855 [2025-04-13 18:22:11,853 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=314, Invalid=1848, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:22:11,853 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 167 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:11,853 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 16 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:22:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-04-13 18:22:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 385. [2025-04-13 18:22:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.4296875) internal successors, (1317), 384 states have internal predecessors, (1317), 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:22:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1317 transitions. [2025-04-13 18:22:11,926 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1317 transitions. Word has length 22 [2025-04-13 18:22:11,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:11,926 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1317 transitions. [2025-04-13 18:22:11,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 24 states have internal predecessors, (55), 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:22:11,926 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1317 transitions. [2025-04-13 18:22:11,927 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:11,927 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:11,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:11,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 18:22:12,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:12,130 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:22:12,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:12,130 INFO L85 PathProgramCache]: Analyzing trace with hash -25217007, now seen corresponding path program 18 times [2025-04-13 18:22:12,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:12,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981314208] [2025-04-13 18:22:12,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:12,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:12,141 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:12,141 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:12,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:12,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:12,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981314208] [2025-04-13 18:22:12,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981314208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:12,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821602238] [2025-04-13 18:22:12,454 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:12,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:12,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:12,456 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:22:12,475 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:22:12,524 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:12,540 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:12,540 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:12,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:12,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:22:12,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:12,675 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:12,676 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:22:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:12,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:12,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:12,763 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 33 treesize of output 78 [2025-04-13 18:22:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821602238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:12,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 17 [2025-04-13 18:22:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475713091] [2025-04-13 18:22:12,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:12,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 18:22:12,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:12,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 18:22:12,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 18:22:12,853 INFO L87 Difference]: Start difference. First operand 385 states and 1317 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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:22:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:14,898 INFO L93 Difference]: Finished difference Result 1219 states and 4115 transitions. [2025-04-13 18:22:14,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:22:14,899 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:14,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:14,903 INFO L225 Difference]: With dead ends: 1219 [2025-04-13 18:22:14,903 INFO L226 Difference]: Without dead ends: 1213 [2025-04-13 18:22:14,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=636, Invalid=2334, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:22:14,905 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 277 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:14,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 28 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:14,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-04-13 18:22:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 385. [2025-04-13 18:22:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.4296875) internal successors, (1317), 384 states have internal predecessors, (1317), 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:22:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1317 transitions. [2025-04-13 18:22:14,989 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1317 transitions. Word has length 22 [2025-04-13 18:22:14,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:14,989 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1317 transitions. [2025-04-13 18:22:14,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 states have internal predecessors, (44), 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:22:14,990 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1317 transitions. [2025-04-13 18:22:14,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:14,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:14,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:14,996 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:22:15,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:15,191 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:22:15,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -410148417, now seen corresponding path program 19 times [2025-04-13 18:22:15,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:15,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166077450] [2025-04-13 18:22:15,192 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:15,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:15,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:15,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:15,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:15,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166077450] [2025-04-13 18:22:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166077450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:15,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561370349] [2025-04-13 18:22:15,509 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:15,511 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:22:15,511 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:22:15,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 18:22:15,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:15,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:15,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:15,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 18:22:15,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:15,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:15,594 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 15 treesize of output 1 [2025-04-13 18:22:15,611 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:15,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:15,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:22:15,755 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-04-13 18:22:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:15,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:15,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561370349] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:15,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:15,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-13 18:22:15,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882650288] [2025-04-13 18:22:15,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:15,887 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:22:15,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:15,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:22:15,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:22:15,888 INFO L87 Difference]: Start difference. First operand 385 states and 1317 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:22:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:17,127 INFO L93 Difference]: Finished difference Result 844 states and 2819 transitions. [2025-04-13 18:22:17,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 18:22:17,127 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 18:22:17,128 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:17,131 INFO L225 Difference]: With dead ends: 844 [2025-04-13 18:22:17,131 INFO L226 Difference]: Without dead ends: 838 [2025-04-13 18:22:17,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=338, Invalid=1642, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 18:22:17,133 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:17,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 19 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:22:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-04-13 18:22:17,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 385. [2025-04-13 18:22:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.4296875) internal successors, (1317), 384 states have internal predecessors, (1317), 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:22:17,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1317 transitions. [2025-04-13 18:22:17,220 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1317 transitions. Word has length 22 [2025-04-13 18:22:17,220 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:17,220 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1317 transitions. [2025-04-13 18:22:17,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 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:22:17,220 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1317 transitions. [2025-04-13 18:22:17,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 18:22:17,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:17,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:17,228 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:22:17,421 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,SelfDestructingSolverStorable21 [2025-04-13 18:22:17,421 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:22:17,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash -243972403, now seen corresponding path program 20 times [2025-04-13 18:22:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:17,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074440309] [2025-04-13 18:22:17,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:17,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:17,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:17,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:17,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:17,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074440309] [2025-04-13 18:22:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074440309] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:17,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135544945] [2025-04-13 18:22:17,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:17,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:17,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:17,931 INFO L229 MonitoredProcess]: Starting monitored process 22 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:22:17,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 18:22:17,980 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 18:22:17,997 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 18:22:17,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:17,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:17,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 18:22:17,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:18,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:18,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2025-04-13 18:22:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:18,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:18,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:18,264 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 33 treesize of output 78 [2025-04-13 18:22:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135544945] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:18,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 20 [2025-04-13 18:22:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251529210] [2025-04-13 18:22:18,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:18,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:22:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:18,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:22:18,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:22:18,372 INFO L87 Difference]: Start difference. First operand 385 states and 1317 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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:22:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:20,312 INFO L93 Difference]: Finished difference Result 1116 states and 3789 transitions. [2025-04-13 18:22:20,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:22:20,312 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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 22 [2025-04-13 18:22:20,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:20,317 INFO L225 Difference]: With dead ends: 1116 [2025-04-13 18:22:20,317 INFO L226 Difference]: Without dead ends: 1110 [2025-04-13 18:22:20,318 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=439, Invalid=2111, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:22:20,318 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 177 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:20,318 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 35 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:20,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-04-13 18:22:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 383. [2025-04-13 18:22:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 3.418848167539267) internal successors, (1306), 382 states have internal predecessors, (1306), 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:22:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1306 transitions. [2025-04-13 18:22:20,408 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 1306 transitions. Word has length 22 [2025-04-13 18:22:20,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:20,408 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 1306 transitions. [2025-04-13 18:22:20,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 21 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:22:20,409 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 1306 transitions. [2025-04-13 18:22:20,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:22:20,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:20,409 INFO L218 NwaCegarLoop]: trace histogram [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:22:20,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 18:22:20,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 18:22:20,610 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:22:20,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1081985355, now seen corresponding path program 21 times [2025-04-13 18:22:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:20,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724730669] [2025-04-13 18:22:20,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:20,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:20,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:20,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:20,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:20,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724730669] [2025-04-13 18:22:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724730669] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:20,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091969681] [2025-04-13 18:22:20,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:20,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:20,674 INFO L229 MonitoredProcess]: Starting monitored process 23 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:22:20,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 18:22:20,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:20,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:20,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:20,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:22:20,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:20,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091969681] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:20,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2025-04-13 18:22:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718048219] [2025-04-13 18:22:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:20,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:22:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:20,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:22:20,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:20,819 INFO L87 Difference]: Start difference. First operand 383 states and 1306 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:21,350 INFO L93 Difference]: Finished difference Result 1093 states and 3652 transitions. [2025-04-13 18:22:21,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:22:21,350 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 18:22:21,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:21,354 INFO L225 Difference]: With dead ends: 1093 [2025-04-13 18:22:21,354 INFO L226 Difference]: Without dead ends: 1079 [2025-04-13 18:22:21,354 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:22:21,355 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 52 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:21,355 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 21 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2025-04-13 18:22:21,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 456. [2025-04-13 18:22:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.498901098901099) internal successors, (1592), 455 states have internal predecessors, (1592), 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:22:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1592 transitions. [2025-04-13 18:22:21,465 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 1592 transitions. Word has length 23 [2025-04-13 18:22:21,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:21,465 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 1592 transitions. [2025-04-13 18:22:21,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:21,465 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 1592 transitions. [2025-04-13 18:22:21,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:22:21,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:21,466 INFO L218 NwaCegarLoop]: trace histogram [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:22:21,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 18:22:21,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:21,667 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:22:21,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1218185279, now seen corresponding path program 22 times [2025-04-13 18:22:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:21,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385684339] [2025-04-13 18:22:21,667 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:21,672 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:21,676 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:21,676 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:21,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:21,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:21,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385684339] [2025-04-13 18:22:21,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385684339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:21,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104496907] [2025-04-13 18:22:21,727 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:21,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:21,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:21,730 INFO L229 MonitoredProcess]: Starting monitored process 24 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:22:21,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 18:22:21,796 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:21,812 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:21,812 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:21,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:21,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 18:22:21,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:21,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104496907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:21,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 18:22:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615082147] [2025-04-13 18:22:21,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:21,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:22:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:22:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:21,862 INFO L87 Difference]: Start difference. First operand 456 states and 1592 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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:22:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:22,210 INFO L93 Difference]: Finished difference Result 1072 states and 3698 transitions. [2025-04-13 18:22:22,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:22:22,210 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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 23 [2025-04-13 18:22:22,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:22,212 INFO L225 Difference]: With dead ends: 1072 [2025-04-13 18:22:22,212 INFO L226 Difference]: Without dead ends: 741 [2025-04-13 18:22:22,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:22,214 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:22,214 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 10 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-04-13 18:22:22,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 456. [2025-04-13 18:22:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 3.4967032967032967) internal successors, (1591), 455 states have internal predecessors, (1591), 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:22:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1591 transitions. [2025-04-13 18:22:22,325 INFO L79 Accepts]: Start accepts. Automaton has 456 states and 1591 transitions. Word has length 23 [2025-04-13 18:22:22,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:22,325 INFO L485 AbstractCegarLoop]: Abstraction has 456 states and 1591 transitions. [2025-04-13 18:22:22,325 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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:22:22,325 INFO L278 IsEmpty]: Start isEmpty. Operand 456 states and 1591 transitions. [2025-04-13 18:22:22,332 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 18:22:22,332 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:22,333 INFO L218 NwaCegarLoop]: trace histogram [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:22:22,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:22,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:22,533 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:22:22,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:22,534 INFO L85 PathProgramCache]: Analyzing trace with hash -960162378, now seen corresponding path program 23 times [2025-04-13 18:22:22,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:22,534 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389156544] [2025-04-13 18:22:22,534 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:22,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:22,539 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:22,542 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:22,542 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:22,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:22,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:22,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389156544] [2025-04-13 18:22:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389156544] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:22,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978083441] [2025-04-13 18:22:22,577 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:22,579 INFO L229 MonitoredProcess]: Starting monitored process 25 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:22:22,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 18:22:22,630 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 18:22:22,647 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 18:22:22,647 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:22,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:22,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:22:22,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:22,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978083441] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:22,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:22:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972978061] [2025-04-13 18:22:22,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:22,700 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:22:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:22,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:22:22,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:22,701 INFO L87 Difference]: Start difference. First operand 456 states and 1591 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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:22:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:23,131 INFO L93 Difference]: Finished difference Result 848 states and 2916 transitions. [2025-04-13 18:22:23,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:23,132 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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 23 [2025-04-13 18:22:23,132 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:23,134 INFO L225 Difference]: With dead ends: 848 [2025-04-13 18:22:23,134 INFO L226 Difference]: Without dead ends: 701 [2025-04-13 18:22:23,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:23,135 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 60 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:23,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 38 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:23,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2025-04-13 18:22:23,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 564. [2025-04-13 18:22:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 3.4174067495559504) internal successors, (1924), 563 states have internal predecessors, (1924), 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:22:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1924 transitions. [2025-04-13 18:22:23,390 INFO L79 Accepts]: Start accepts. Automaton has 564 states and 1924 transitions. Word has length 23 [2025-04-13 18:22:23,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:23,390 INFO L485 AbstractCegarLoop]: Abstraction has 564 states and 1924 transitions. [2025-04-13 18:22:23,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 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:22:23,390 INFO L278 IsEmpty]: Start isEmpty. Operand 564 states and 1924 transitions. [2025-04-13 18:22:23,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:22:23,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:23,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:23,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 18:22:23,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 18:22:23,591 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:22:23,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1444007871, now seen corresponding path program 24 times [2025-04-13 18:22:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:23,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065309457] [2025-04-13 18:22:23,592 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:23,597 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:22:23,601 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:23,601 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:23,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:23,649 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065309457] [2025-04-13 18:22:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065309457] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:23,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839128187] [2025-04-13 18:22:23,650 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:23,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:23,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:23,651 INFO L229 MonitoredProcess]: Starting monitored process 26 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:22:23,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 18:22:23,704 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 18:22:23,721 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:23,721 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:22:23,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:23,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:22:23,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:23,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:23,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:23,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839128187] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:23,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-13 18:22:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928294928] [2025-04-13 18:22:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:23,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:22:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:23,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:22:23,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:23,799 INFO L87 Difference]: Start difference. First operand 564 states and 1924 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:24,297 INFO L93 Difference]: Finished difference Result 1020 states and 3243 transitions. [2025-04-13 18:22:24,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:22:24,298 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:22:24,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:24,300 INFO L225 Difference]: With dead ends: 1020 [2025-04-13 18:22:24,300 INFO L226 Difference]: Without dead ends: 1006 [2025-04-13 18:22:24,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:22:24,301 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 46 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:24,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 15 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-04-13 18:22:24,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 554. [2025-04-13 18:22:24,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.3797468354430378) internal successors, (1869), 553 states have internal predecessors, (1869), 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:22:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1869 transitions. [2025-04-13 18:22:24,476 INFO L79 Accepts]: Start accepts. Automaton has 554 states and 1869 transitions. Word has length 24 [2025-04-13 18:22:24,476 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:24,476 INFO L485 AbstractCegarLoop]: Abstraction has 554 states and 1869 transitions. [2025-04-13 18:22:24,476 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:24,476 INFO L278 IsEmpty]: Start isEmpty. Operand 554 states and 1869 transitions. [2025-04-13 18:22:24,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:22:24,476 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:24,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:24,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 18:22:24,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 18:22:24,677 INFO L403 AbstractCegarLoop]: === Iteration 28 === 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:22:24,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2088872367, now seen corresponding path program 25 times [2025-04-13 18:22:24,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:24,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802374755] [2025-04-13 18:22:24,678 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:24,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:24,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:22:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:24,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:24,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802374755] [2025-04-13 18:22:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802374755] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:24,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250820319] [2025-04-13 18:22:24,746 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:24,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:24,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:24,748 INFO L229 MonitoredProcess]: Starting monitored process 27 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:22:24,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 18:22:24,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:22:24,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:24,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:24,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:22:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:24,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 18:22:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250820319] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:24,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:22:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-13 18:22:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630909810] [2025-04-13 18:22:24,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:24,911 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:22:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:24,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:22:24,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:22:24,911 INFO L87 Difference]: Start difference. First operand 554 states and 1869 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:25,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:25,404 INFO L93 Difference]: Finished difference Result 985 states and 3141 transitions. [2025-04-13 18:22:25,404 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:22:25,404 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:22:25,404 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:25,407 INFO L225 Difference]: With dead ends: 985 [2025-04-13 18:22:25,407 INFO L226 Difference]: Without dead ends: 971 [2025-04-13 18:22:25,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:22:25,407 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 61 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:25,407 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 16 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:25,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-04-13 18:22:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 521. [2025-04-13 18:22:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 3.396153846153846) internal successors, (1766), 520 states have internal predecessors, (1766), 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:22:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1766 transitions. [2025-04-13 18:22:25,572 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1766 transitions. Word has length 24 [2025-04-13 18:22:25,572 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:25,572 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1766 transitions. [2025-04-13 18:22:25,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:25,572 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1766 transitions. [2025-04-13 18:22:25,573 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 18:22:25,573 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:25,573 INFO L218 NwaCegarLoop]: trace histogram [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:22:25,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 18:22:25,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 18:22:25,774 INFO L403 AbstractCegarLoop]: === Iteration 29 === 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:22:25,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -209534865, now seen corresponding path program 1 times [2025-04-13 18:22:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:25,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453771499] [2025-04-13 18:22:25,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:25,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:25,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:22:25,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:25,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:25,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:25,827 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:25,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:25,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453771499] [2025-04-13 18:22:25,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453771499] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:25,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239511390] [2025-04-13 18:22:25,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:25,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:25,829 INFO L229 MonitoredProcess]: Starting monitored process 28 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:22:25,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 18:22:25,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 18:22:25,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 18:22:25,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:25,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:25,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:22:25,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:25,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:22:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239511390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:25,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:25,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 18:22:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59433982] [2025-04-13 18:22:25,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:25,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:22:25,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:22:25,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:22:25,989 INFO L87 Difference]: Start difference. First operand 521 states and 1766 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:26,210 INFO L93 Difference]: Finished difference Result 623 states and 2018 transitions. [2025-04-13 18:22:26,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:22:26,210 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 18:22:26,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:26,211 INFO L225 Difference]: With dead ends: 623 [2025-04-13 18:22:26,211 INFO L226 Difference]: Without dead ends: 294 [2025-04-13 18:22:26,211 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-04-13 18:22:26,212 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:26,212 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:26,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-13 18:22:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-04-13 18:22:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.3344709897610922) internal successors, (977), 293 states have internal predecessors, (977), 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:22:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 977 transitions. [2025-04-13 18:22:26,287 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 977 transitions. Word has length 24 [2025-04-13 18:22:26,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:26,287 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 977 transitions. [2025-04-13 18:22:26,287 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:26,287 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 977 transitions. [2025-04-13 18:22:26,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:22:26,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:26,288 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] [2025-04-13 18:22:26,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 18:22:26,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 18:22:26,488 INFO L403 AbstractCegarLoop]: === Iteration 30 === 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:22:26,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:26,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1454310241, now seen corresponding path program 2 times [2025-04-13 18:22:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:26,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341945592] [2025-04-13 18:22:26,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:26,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:26,493 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:22:26,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:22:26,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:22:26,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:26,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341945592] [2025-04-13 18:22:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341945592] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:26,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561534911] [2025-04-13 18:22:26,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:26,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:26,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:26,566 INFO L229 MonitoredProcess]: Starting monitored process 29 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:22:26,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 18:22:26,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 18:22:26,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:22:26,660 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:26,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:26,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:22:26,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:22:26,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:22:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561534911] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:26,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:26,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-13 18:22:26,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619313323] [2025-04-13 18:22:26,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:26,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:22:26,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:26,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:22:26,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:26,752 INFO L87 Difference]: Start difference. First operand 294 states and 977 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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:22:27,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:27,016 INFO L93 Difference]: Finished difference Result 439 states and 1453 transitions. [2025-04-13 18:22:27,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:22:27,016 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:22:27,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:27,017 INFO L225 Difference]: With dead ends: 439 [2025-04-13 18:22:27,017 INFO L226 Difference]: Without dead ends: 349 [2025-04-13 18:22:27,017 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:22:27,018 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 126 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:27,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 26 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:22:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-04-13 18:22:27,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 319. [2025-04-13 18:22:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 3.349056603773585) internal successors, (1065), 318 states have internal predecessors, (1065), 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:22:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 1065 transitions. [2025-04-13 18:22:27,115 INFO L79 Accepts]: Start accepts. Automaton has 319 states and 1065 transitions. Word has length 26 [2025-04-13 18:22:27,115 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:27,115 INFO L485 AbstractCegarLoop]: Abstraction has 319 states and 1065 transitions. [2025-04-13 18:22:27,115 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 14 states have internal predecessors, (36), 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:22:27,115 INFO L278 IsEmpty]: Start isEmpty. Operand 319 states and 1065 transitions. [2025-04-13 18:22:27,115 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:27,116 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:27,116 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:27,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:27,316 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:27,316 INFO L403 AbstractCegarLoop]: === Iteration 31 === 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:22:27,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1887396160, now seen corresponding path program 3 times [2025-04-13 18:22:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:27,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700831823] [2025-04-13 18:22:27,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:27,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:27,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:27,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:27,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:27,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700831823] [2025-04-13 18:22:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700831823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:27,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721383474] [2025-04-13 18:22:27,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:27,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:27,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:27,974 INFO L229 MonitoredProcess]: Starting monitored process 30 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:22:27,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 18:22:28,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:28,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:28,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:22:28,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:28,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 18:22:28,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:28,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:28,331 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:22:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:28,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:28,560 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:28,561 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 81 treesize of output 338 [2025-04-13 18:22:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721383474] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:32,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 31 [2025-04-13 18:22:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14366363] [2025-04-13 18:22:32,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:32,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 18:22:32,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:32,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 18:22:32,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:22:32,956 INFO L87 Difference]: Start difference. First operand 319 states and 1065 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 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:22:35,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:35,790 INFO L93 Difference]: Finished difference Result 917 states and 3194 transitions. [2025-04-13 18:22:35,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 18:22:35,790 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 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 27 [2025-04-13 18:22:35,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:35,793 INFO L225 Difference]: With dead ends: 917 [2025-04-13 18:22:35,793 INFO L226 Difference]: Without dead ends: 799 [2025-04-13 18:22:35,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1687 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=618, Invalid=5862, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:22:35,795 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 296 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 2640 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:35,795 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 78 Invalid, 2695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2640 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:22:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-04-13 18:22:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 493. [2025-04-13 18:22:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 3.477642276422764) internal successors, (1711), 492 states have internal predecessors, (1711), 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:22:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1711 transitions. [2025-04-13 18:22:36,024 INFO L79 Accepts]: Start accepts. Automaton has 493 states and 1711 transitions. Word has length 27 [2025-04-13 18:22:36,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:36,024 INFO L485 AbstractCegarLoop]: Abstraction has 493 states and 1711 transitions. [2025-04-13 18:22:36,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 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:22:36,024 INFO L278 IsEmpty]: Start isEmpty. Operand 493 states and 1711 transitions. [2025-04-13 18:22:36,025 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:36,025 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:36,025 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:36,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 18:22:36,225 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:36,225 INFO L403 AbstractCegarLoop]: === Iteration 32 === 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:22:36,226 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash 483647014, now seen corresponding path program 4 times [2025-04-13 18:22:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:36,226 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366993609] [2025-04-13 18:22:36,226 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:36,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:36,231 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:36,246 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:36,246 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:36,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:36,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:36,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:36,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366993609] [2025-04-13 18:22:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366993609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:36,881 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759232384] [2025-04-13 18:22:36,881 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:36,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:36,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:36,882 INFO L229 MonitoredProcess]: Starting monitored process 31 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:22:36,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 18:22:36,940 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:36,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:36,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:36,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:36,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 18:22:36,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:36,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:37,002 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 19 treesize of output 1 [2025-04-13 18:22:37,022 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:37,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:37,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:22:37,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:22:37,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:37,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:22:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:37,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:37,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759232384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:37,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:37,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 10] total 37 [2025-04-13 18:22:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121214036] [2025-04-13 18:22:37,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:37,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 18:22:37,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:37,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 18:22:37,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:22:37,571 INFO L87 Difference]: Start difference. First operand 493 states and 1711 transitions. Second operand has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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:22:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:40,436 INFO L93 Difference]: Finished difference Result 1003 states and 3325 transitions. [2025-04-13 18:22:40,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 18:22:40,437 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 18:22:40,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:40,440 INFO L225 Difference]: With dead ends: 1003 [2025-04-13 18:22:40,440 INFO L226 Difference]: Without dead ends: 997 [2025-04-13 18:22:40,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=564, Invalid=5288, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 18:22:40,441 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 465 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:40,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 24 Invalid, 2357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:22:40,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2025-04-13 18:22:40,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 530. [2025-04-13 18:22:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.429111531190926) internal successors, (1814), 529 states have internal predecessors, (1814), 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:22:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1814 transitions. [2025-04-13 18:22:40,672 INFO L79 Accepts]: Start accepts. Automaton has 530 states and 1814 transitions. Word has length 27 [2025-04-13 18:22:40,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:40,672 INFO L485 AbstractCegarLoop]: Abstraction has 530 states and 1814 transitions. [2025-04-13 18:22:40,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 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:22:40,672 INFO L278 IsEmpty]: Start isEmpty. Operand 530 states and 1814 transitions. [2025-04-13 18:22:40,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:40,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:40,673 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:40,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 18:22:40,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 18:22:40,873 INFO L403 AbstractCegarLoop]: === Iteration 33 === 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:22:40,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1116918178, now seen corresponding path program 5 times [2025-04-13 18:22:40,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:40,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683958094] [2025-04-13 18:22:40,875 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:40,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:40,880 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:40,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:40,887 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:40,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:22:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:41,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683958094] [2025-04-13 18:22:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683958094] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:41,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196559991] [2025-04-13 18:22:41,593 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:41,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:41,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:41,595 INFO L229 MonitoredProcess]: Starting monitored process 32 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:22:41,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 18:22:41,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:41,679 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:41,679 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:41,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 18:22:41,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:41,760 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 15 treesize of output 1 [2025-04-13 18:22:42,042 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:42,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:22:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:42,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:42,284 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196559991] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:42,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 9] total 35 [2025-04-13 18:22:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113014839] [2025-04-13 18:22:42,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:42,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:22:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:42,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:22:42,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:22:42,285 INFO L87 Difference]: Start difference. First operand 530 states and 1814 transitions. Second operand has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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:22:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:45,062 INFO L93 Difference]: Finished difference Result 792 states and 2657 transitions. [2025-04-13 18:22:45,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 18:22:45,063 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 18:22:45,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:45,065 INFO L225 Difference]: With dead ends: 792 [2025-04-13 18:22:45,065 INFO L226 Difference]: Without dead ends: 786 [2025-04-13 18:22:45,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=501, Invalid=4755, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 18:22:45,067 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 211 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:45,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 75 Invalid, 2572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:22:45,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-04-13 18:22:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 570. [2025-04-13 18:22:45,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 3.428822495606327) internal successors, (1951), 569 states have internal predecessors, (1951), 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:22:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 1951 transitions. [2025-04-13 18:22:45,365 INFO L79 Accepts]: Start accepts. Automaton has 570 states and 1951 transitions. Word has length 27 [2025-04-13 18:22:45,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:45,366 INFO L485 AbstractCegarLoop]: Abstraction has 570 states and 1951 transitions. [2025-04-13 18:22:45,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 36 states have internal predecessors, (68), 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:22:45,366 INFO L278 IsEmpty]: Start isEmpty. Operand 570 states and 1951 transitions. [2025-04-13 18:22:45,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:45,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:45,366 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] [2025-04-13 18:22:45,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 18:22:45,567 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:45,567 INFO L403 AbstractCegarLoop]: === Iteration 34 === 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:22:45,567 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:45,567 INFO L85 PathProgramCache]: Analyzing trace with hash -732595258, now seen corresponding path program 1 times [2025-04-13 18:22:45,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:45,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18233274] [2025-04-13 18:22:45,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:45,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:45,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:22:45,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:46,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18233274] [2025-04-13 18:22:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18233274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:46,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30560700] [2025-04-13 18:22:46,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:22:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:46,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:46,247 INFO L229 MonitoredProcess]: Starting monitored process 33 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:22:46,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 18:22:46,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:22:46,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:46,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:46,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:46,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-13 18:22:46,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:46,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-13 18:22:46,366 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 19 treesize of output 1 [2025-04-13 18:22:46,383 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 18:22:46,384 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-13 18:22:46,403 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-13 18:22:46,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 18:22:46,622 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:46,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 15 [2025-04-13 18:22:46,627 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:22:46,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:46,808 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:22:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30560700] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:46,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 9] total 35 [2025-04-13 18:22:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123889210] [2025-04-13 18:22:46,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:46,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 18:22:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 18:22:46,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:22:46,809 INFO L87 Difference]: Start difference. First operand 570 states and 1951 transitions. Second operand has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 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:22:49,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:49,642 INFO L93 Difference]: Finished difference Result 1296 states and 4226 transitions. [2025-04-13 18:22:49,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:22:49,642 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 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 27 [2025-04-13 18:22:49,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:49,645 INFO L225 Difference]: With dead ends: 1296 [2025-04-13 18:22:49,645 INFO L226 Difference]: Without dead ends: 1213 [2025-04-13 18:22:49,646 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=415, Invalid=4007, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 18:22:49,646 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 539 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2945 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:49,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 29 Invalid, 2979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2945 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:22:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-04-13 18:22:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 670. [2025-04-13 18:22:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 669 states have (on average 3.4499252615844545) internal successors, (2308), 669 states have internal predecessors, (2308), 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:22:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 2308 transitions. [2025-04-13 18:22:49,973 INFO L79 Accepts]: Start accepts. Automaton has 670 states and 2308 transitions. Word has length 27 [2025-04-13 18:22:49,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:49,973 INFO L485 AbstractCegarLoop]: Abstraction has 670 states and 2308 transitions. [2025-04-13 18:22:49,973 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 36 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:22:49,973 INFO L278 IsEmpty]: Start isEmpty. Operand 670 states and 2308 transitions. [2025-04-13 18:22:49,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:49,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:49,974 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:22:49,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 18:22:50,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:50,175 INFO L403 AbstractCegarLoop]: === Iteration 35 === 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:22:50,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash -570503936, now seen corresponding path program 6 times [2025-04-13 18:22:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:50,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547997412] [2025-04-13 18:22:50,175 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:50,180 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-04-13 18:22:50,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:50,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:22:50,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:50,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:50,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547997412] [2025-04-13 18:22:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547997412] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:22:50,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648945454] [2025-04-13 18:22:50,862 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:50,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:22:50,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:22:50,864 INFO L229 MonitoredProcess]: Starting monitored process 34 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:22:50,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 18:22:50,943 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-04-13 18:22:50,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:50,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 18:22:50,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 18:22:50,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:22:51,144 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:51,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 31 [2025-04-13 18:22:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:51,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:22:51,341 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:22:51,341 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 81 treesize of output 338 [2025-04-13 18:22:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:22:54,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648945454] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:22:54,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:22:54,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 26 [2025-04-13 18:22:54,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495239034] [2025-04-13 18:22:54,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:22:54,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:22:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:22:54,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:54,877 INFO L87 Difference]: Start difference. First operand 670 states and 2308 transitions. Second operand has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:56,118 INFO L93 Difference]: Finished difference Result 841 states and 2819 transitions. [2025-04-13 18:22:56,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:22:56,118 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 18:22:56,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:56,120 INFO L225 Difference]: With dead ends: 841 [2025-04-13 18:22:56,121 INFO L226 Difference]: Without dead ends: 835 [2025-04-13 18:22:56,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:22:56,121 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 79 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:56,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 18 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:22:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-04-13 18:22:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 676. [2025-04-13 18:22:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 675 states have (on average 3.4474074074074075) internal successors, (2327), 675 states have internal predecessors, (2327), 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:22:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 2327 transitions. [2025-04-13 18:22:56,457 INFO L79 Accepts]: Start accepts. Automaton has 676 states and 2327 transitions. Word has length 27 [2025-04-13 18:22:56,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:56,457 INFO L485 AbstractCegarLoop]: Abstraction has 676 states and 2327 transitions. [2025-04-13 18:22:56,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,457 INFO L278 IsEmpty]: Start isEmpty. Operand 676 states and 2327 transitions. [2025-04-13 18:22:56,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 18:22:56,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:56,458 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] [2025-04-13 18:22:56,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-04-13 18:22:56,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 18:22:56,658 INFO L403 AbstractCegarLoop]: === Iteration 36 === 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:22:56,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:56,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1492698920, now seen corresponding path program 2 times [2025-04-13 18:22:56,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:56,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477005693] [2025-04-13 18:22:56,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:56,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 18:22:56,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:56,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:56,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:22:56,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 18:22:56,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 18:22:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 18:22:56,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:22:56,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 18:22:56,714 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 18:22:56,714 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:22:56,715 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:22:56,716 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:22:56,716 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:22:56,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:22:56,718 INFO L422 BasicCegarLoop]: Path program histogram: [25, 6, 2, 1, 1, 1] [2025-04-13 18:22:56,779 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:22:56,779 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:22:56,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:22:56 BasicIcfg [2025-04-13 18:22:56,781 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:22:56,782 INFO L158 Benchmark]: Toolchain (without parser) took 79194.43ms. Allocated memory was 155.2MB in the beginning and 788.5MB in the end (delta: 633.3MB). Free memory was 110.8MB in the beginning and 464.4MB in the end (delta: -353.7MB). Peak memory consumption was 281.7MB. Max. memory is 8.0GB. [2025-04-13 18:22:56,782 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:22:56,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.68ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 94.5MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:22:56,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.81ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:22:56,782 INFO L158 Benchmark]: Boogie Preprocessor took 38.67ms. Allocated memory is still 155.2MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:22:56,782 INFO L158 Benchmark]: RCFGBuilder took 823.16ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 64.2MB in the end (delta: 24.9MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. [2025-04-13 18:22:56,783 INFO L158 Benchmark]: TraceAbstraction took 78036.23ms. Allocated memory was 155.2MB in the beginning and 788.5MB in the end (delta: 633.3MB). Free memory was 63.3MB in the beginning and 464.4MB in the end (delta: -401.1MB). Peak memory consumption was 232.7MB. Max. memory is 8.0GB. [2025-04-13 18:22:56,783 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.16ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 249.68ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 94.5MB in the end (delta: 15.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.81ms. Allocated memory is still 155.2MB. Free memory was 94.5MB in the beginning and 91.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.67ms. Allocated memory is still 155.2MB. Free memory was 91.8MB in the beginning and 89.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 823.16ms. Allocated memory is still 155.2MB. Free memory was 89.1MB in the beginning and 64.2MB in the end (delta: 24.9MB). Peak memory consumption was 70.1MB. Max. memory is 8.0GB. * TraceAbstraction took 78036.23ms. Allocated memory was 155.2MB in the beginning and 788.5MB in the end (delta: 633.3MB). Free memory was 63.3MB in the beginning and 464.4MB in the end (delta: -401.1MB). Peak memory consumption was 232.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 92]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] 0 int* A; [L39] 0 int* B; [L40] 0 _Atomic int res2; [L41] 0 int res1, M, N; [L73] 0 pthread_t t1, t2, t3; [L76] 0 M = __VERIFIER_nondet_int() [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={0:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-3:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L79] CALL, EXPR 0 create_fresh_int_array(N) [L98] CALL 0 assume_abort_if_not(size >= 0) [L35] COND FALSE 0 !(!cond) [L98] RET 0 assume_abort_if_not(size >= 0) [L99] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L35] COND FALSE 0 !(!cond) [L99] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L101] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L102] 0 int i = 0; VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=0, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=1, res1=0, res2=0, size=2] [L102] COND TRUE 0 i < size [L103] 0 arr[i] = __VERIFIER_nondet_int() [L102] 0 i++ VAL [A={-3:0}, B={0:0}, M=1, N=2, \at(size, Pre)=2, arr={-5:0}, i=2, res1=0, res2=0, size=2] [L102] COND FALSE 0 !(i < size) [L105] 0 return arr; [L79] RET, EXPR 0 create_fresh_int_array(N) [L79] 0 B = create_fresh_int_array(N) [L81] CALL 0 assume_abort_if_not(M >= 0 && M < N) [L35] COND FALSE 0 !(!cond) [L81] RET 0 assume_abort_if_not(M >= 0 && M < N) [L84] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=0, res2=0, t1=7] [L47] 1 int i=0; VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=0, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=1, res1=-3, res2=0] [L47] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(A[i], B[i]) [L48] CALL, EXPR 1 plus(res1, plus(A[i], B[i])) [L109] CALL 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 1 !(!cond) [L109] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 1 return a + b; [L48] RET, EXPR 1 plus(res1, plus(A[i], B[i])) [L48] 1 res1 = plus(res1, plus(A[i], B[i])) [L47] 1 i++ VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=2, res1=-4, res2=0] [L47] COND FALSE 1 !(i= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(A[i], B[i]) [L56] CALL, EXPR 2 plus(res2, plus(A[i], B[i])) [L109] CALL 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 2 !(!cond) [L109] RET 2 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 2 !(!cond) [L110] RET 2 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 2 return a + b; [L56] RET, EXPR 2 plus(res2, plus(A[i], B[i])) [L56] 2 int tmp = plus(res2, plus(A[i], B[i])); [L86] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=-4, res2=0, t1=7, t2=8, t3=9] [L87] FCALL, JOIN 1 pthread_join(t1, 0) VAL [A={-3:0}, B={-5:0}, M=1, N=2, res1=-4, res2=0, t1=7, t2=8, t3=9] [L64] 3 int i=M; [L64] COND TRUE 3 i= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(A[i], B[i]) [L65] CALL, EXPR 3 plus(res2, plus(A[i], B[i])) [L109] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L35] COND FALSE 3 !(!cond) [L109] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L110] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L35] COND FALSE 3 !(!cond) [L110] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L111] 3 return a + b; [L65] RET, EXPR 3 plus(res2, plus(A[i], B[i])) [L65] 3 int tmp = plus(res2, plus(A[i], B[i])); [L57] 2 res2 = tmp VAL [A={-3:0}, B={-5:0}, M=1, N=2, \at(_argptr, Pre)={0:0}, _argptr={0:0}, i=0, res1=-4, res2=-3, tmp=-3] [L55] 2 i++ [L55] COND FALSE 2 !(i