/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:15:33,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:15:33,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:15:33,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:15:33,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:15:33,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:15:33,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:15:33,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:15:33,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:15:33,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:15:33,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:15:33,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:15:33,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:15:33,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:15:33,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:15:33,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:15:33,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:15:33,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:15:33,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:15:33,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:15:33,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:15:34,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:15:34,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:15:34,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:15:34,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:15:34,060 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:15:34,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-13 23:15:35,397 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbf3cb22/0b1672b3860843e4866db155ef15b07a/FLAG4168c2ecf [2025-04-13 23:15:35,606 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:15:35,607 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c [2025-04-13 23:15:35,614 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbf3cb22/0b1672b3860843e4866db155ef15b07a/FLAG4168c2ecf [2025-04-13 23:15:36,397 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbf3cb22/0b1672b3860843e4866db155ef15b07a [2025-04-13 23:15:36,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:15:36,401 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:15:36,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:15:36,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:15:36,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:15:36,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccf7941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36, skipping insertion in model container [2025-04-13 23:15:36,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:15:36,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-13 23:15:36,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:15:36,595 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:15:36,623 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive-alt.wvr.c[2676,2689] [2025-04-13 23:15:36,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:15:36,636 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:15:36,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36 WrapperNode [2025-04-13 23:15:36,636 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:15:36,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:15:36,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:15:36,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:15:36,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,667 INFO L138 Inliner]: procedures = 23, calls = 27, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 134 [2025-04-13 23:15:36,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:15:36,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:15:36,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:15:36,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:15:36,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,691 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 23:15:36,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:15:36,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:15:36,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:15:36,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:15:36,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (1/1) ... [2025-04-13 23:15:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:15:36,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:36,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:15:36,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:15:36,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:15:36,739 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:15:36,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:15:36,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:15:36,740 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:15:36,803 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:15:36,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:15:37,049 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:15:37,050 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:15:37,050 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:15:37,224 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:15:37,235 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:15:37,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:15:37 BoogieIcfgContainer [2025-04-13 23:15:37,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:15:37,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:15:37,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:15:37,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:15:37,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:15:36" (1/3) ... [2025-04-13 23:15:37,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384180e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:15:37, skipping insertion in model container [2025-04-13 23:15:37,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:15:36" (2/3) ... [2025-04-13 23:15:37,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384180e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:15:37, skipping insertion in model container [2025-04-13 23:15:37,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:15:37" (3/3) ... [2025-04-13 23:15:37,243 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-04-13 23:15:37,252 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:15:37,253 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 20 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:15:37,253 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:15:37,319 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:15:37,346 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 25 transitions, 64 flow [2025-04-13 23:15:37,359 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 57 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,378 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:15:37,388 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;@41e90a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:15:37,388 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:15:37,389 INFO L278 IsEmpty]: Start isEmpty. Operand has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 57 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,393 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 23:15:37,393 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:37,393 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:37,394 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:37,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:37,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1914925129, now seen corresponding path program 1 times [2025-04-13 23:15:37,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:37,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679634516] [2025-04-13 23:15:37,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:37,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:37,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 23:15:37,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:15:37,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:37,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679634516] [2025-04-13 23:15:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679634516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:37,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:37,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:15:37,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117816641] [2025-04-13 23:15:37,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:37,633 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:15:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:37,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:15:37,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:37,649 INFO L87 Difference]: Start difference. First operand has 58 states, 57 states have (on average 2.789473684210526) internal successors, (159), 57 states have internal predecessors, (159), 0 states have call successors, (0), 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, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:37,727 INFO L93 Difference]: Finished difference Result 138 states and 378 transitions. [2025-04-13 23:15:37,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:15:37,730 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-04-13 23:15:37,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:37,736 INFO L225 Difference]: With dead ends: 138 [2025-04-13 23:15:37,737 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 23:15:37,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:37,744 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:37,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:15:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 23:15:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2025-04-13 23:15:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.652173913043478) internal successors, (183), 69 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 183 transitions. [2025-04-13 23:15:37,776 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 183 transitions. Word has length 12 [2025-04-13 23:15:37,776 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:37,777 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 183 transitions. [2025-04-13 23:15:37,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,777 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 183 transitions. [2025-04-13 23:15:37,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 23:15:37,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:37,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:37,779 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:15:37,779 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:37,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 136393849, now seen corresponding path program 1 times [2025-04-13 23:15:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:37,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814199045] [2025-04-13 23:15:37,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:15:37,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:15:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:37,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:37,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814199045] [2025-04-13 23:15:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814199045] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:37,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:15:37,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613259412] [2025-04-13 23:15:37,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:37,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:15:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:37,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:15:37,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:37,890 INFO L87 Difference]: Start difference. First operand 70 states and 183 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:37,938 INFO L93 Difference]: Finished difference Result 116 states and 295 transitions. [2025-04-13 23:15:37,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:15:37,939 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-04-13 23:15:37,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:37,939 INFO L225 Difference]: With dead ends: 116 [2025-04-13 23:15:37,939 INFO L226 Difference]: Without dead ends: 67 [2025-04-13 23:15:37,940 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:37,940 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:37,940 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:15:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-04-13 23:15:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-04-13 23:15:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 2.4393939393939394) internal successors, (161), 66 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 161 transitions. [2025-04-13 23:15:37,949 INFO L79 Accepts]: Start accepts. Automaton has 67 states and 161 transitions. Word has length 14 [2025-04-13 23:15:37,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:37,949 INFO L485 AbstractCegarLoop]: Abstraction has 67 states and 161 transitions. [2025-04-13 23:15:37,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:37,950 INFO L278 IsEmpty]: Start isEmpty. Operand 67 states and 161 transitions. [2025-04-13 23:15:37,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 23:15:37,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:37,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:37,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:15:37,951 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:37,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1516316613, now seen corresponding path program 1 times [2025-04-13 23:15:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:37,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660053458] [2025-04-13 23:15:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:37,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 23:15:37,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 23:15:37,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:37,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:38,128 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660053458] [2025-04-13 23:15:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660053458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:38,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:38,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:15:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198291017] [2025-04-13 23:15:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:38,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:15:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:38,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:15:38,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:15:38,129 INFO L87 Difference]: Start difference. First operand 67 states and 161 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:38,190 INFO L93 Difference]: Finished difference Result 133 states and 321 transitions. [2025-04-13 23:15:38,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:15:38,191 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 23:15:38,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:38,191 INFO L225 Difference]: With dead ends: 133 [2025-04-13 23:15:38,191 INFO L226 Difference]: Without dead ends: 68 [2025-04-13 23:15:38,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:15:38,192 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:38,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:15:38,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-04-13 23:15:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-04-13 23:15:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.417910447761194) internal successors, (162), 67 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 162 transitions. [2025-04-13 23:15:38,203 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 162 transitions. Word has length 16 [2025-04-13 23:15:38,203 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:38,203 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 162 transitions. [2025-04-13 23:15:38,204 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:38,217 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 162 transitions. [2025-04-13 23:15:38,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:15:38,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:38,217 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 23:15:38,218 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:15:38,218 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:38,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:38,218 INFO L85 PathProgramCache]: Analyzing trace with hash -166664318, now seen corresponding path program 1 times [2025-04-13 23:15:38,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:38,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709563703] [2025-04-13 23:15:38,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:38,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:15:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:15:38,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:38,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:38,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:38,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709563703] [2025-04-13 23:15:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709563703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:38,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277160458] [2025-04-13 23:15:38,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:38,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:38,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:38,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:15:38,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:15:38,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:15:38,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:15:38,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:38,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:38,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:15:38,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:38,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:15:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:39,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:39,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2025-04-13 23:15:39,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:15:39,433 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 78 treesize of output 68 [2025-04-13 23:15:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277160458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:39,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 23:15:39,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865361911] [2025-04-13 23:15:39,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:39,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:15:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:39,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:15:39,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:15:39,570 INFO L87 Difference]: Start difference. First operand 68 states and 162 transitions. Second operand has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:40,060 INFO L93 Difference]: Finished difference Result 304 states and 773 transitions. [2025-04-13 23:15:40,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:15:40,062 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 23:15:40,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:40,063 INFO L225 Difference]: With dead ends: 304 [2025-04-13 23:15:40,063 INFO L226 Difference]: Without dead ends: 200 [2025-04-13 23:15:40,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:15:40,066 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 132 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:40,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 30 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:15:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-04-13 23:15:40,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 116. [2025-04-13 23:15:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.391304347826087) internal successors, (275), 115 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 275 transitions. [2025-04-13 23:15:40,079 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 275 transitions. Word has length 17 [2025-04-13 23:15:40,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:40,080 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 275 transitions. [2025-04-13 23:15:40,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,080 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 275 transitions. [2025-04-13 23:15:40,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:15:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:40,082 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:15:40,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:40,283 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:40,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1277116133, now seen corresponding path program 2 times [2025-04-13 23:15:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:40,284 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125428474] [2025-04-13 23:15:40,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:15:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:40,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 23:15:40,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 18 statements. [2025-04-13 23:15:40,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:15:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:40,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:15:40,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:40,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125428474] [2025-04-13 23:15:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125428474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:15:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785477377] [2025-04-13 23:15:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:40,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:15:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:40,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:15:40,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:15:40,404 INFO L87 Difference]: Start difference. First operand 116 states and 275 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 23:15:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:40,472 INFO L93 Difference]: Finished difference Result 168 states and 409 transitions. [2025-04-13 23:15:40,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:15:40,473 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 18 [2025-04-13 23:15:40,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:40,474 INFO L225 Difference]: With dead ends: 168 [2025-04-13 23:15:40,474 INFO L226 Difference]: Without dead ends: 154 [2025-04-13 23:15:40,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:15:40,474 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:40,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:15:40,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-04-13 23:15:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2025-04-13 23:15:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.391304347826087) internal successors, (275), 115 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 275 transitions. [2025-04-13 23:15:40,491 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 275 transitions. Word has length 18 [2025-04-13 23:15:40,491 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:40,491 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 275 transitions. [2025-04-13 23:15:40,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 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 23:15:40,491 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 275 transitions. [2025-04-13 23:15:40,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:15:40,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:40,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:40,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:15:40,492 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:40,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 907624221, now seen corresponding path program 3 times [2025-04-13 23:15:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:40,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596302950] [2025-04-13 23:15:40,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:15:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:40,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:15:40,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:15:40,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:15:40,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:15:40,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:40,553 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596302950] [2025-04-13 23:15:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596302950] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:15:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943082584] [2025-04-13 23:15:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:40,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:15:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:40,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:15:40,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:15:40,554 INFO L87 Difference]: Start difference. First operand 116 states and 275 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:40,617 INFO L93 Difference]: Finished difference Result 294 states and 738 transitions. [2025-04-13 23:15:40,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:15:40,617 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:15:40,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:40,619 INFO L225 Difference]: With dead ends: 294 [2025-04-13 23:15:40,619 INFO L226 Difference]: Without dead ends: 236 [2025-04-13 23:15:40,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:15:40,619 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 18 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:40,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:15:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-13 23:15:40,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2025-04-13 23:15:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.5583756345177666) internal successors, (504), 197 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 504 transitions. [2025-04-13 23:15:40,635 INFO L79 Accepts]: Start accepts. Automaton has 198 states and 504 transitions. Word has length 20 [2025-04-13 23:15:40,635 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:40,635 INFO L485 AbstractCegarLoop]: Abstraction has 198 states and 504 transitions. [2025-04-13 23:15:40,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,635 INFO L278 IsEmpty]: Start isEmpty. Operand 198 states and 504 transitions. [2025-04-13 23:15:40,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:15:40,636 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:40,636 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:40,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:15:40,636 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:40,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:40,637 INFO L85 PathProgramCache]: Analyzing trace with hash -183768097, now seen corresponding path program 1 times [2025-04-13 23:15:40,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:40,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595096569] [2025-04-13 23:15:40,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:40,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:40,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:15:40,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:15:40,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:40,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:15:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:40,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595096569] [2025-04-13 23:15:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595096569] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:15:40,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:15:40,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:15:40,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666923050] [2025-04-13 23:15:40,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:15:40,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:15:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:40,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:15:40,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:40,748 INFO L87 Difference]: Start difference. First operand 198 states and 504 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:40,813 INFO L93 Difference]: Finished difference Result 351 states and 974 transitions. [2025-04-13 23:15:40,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:15:40,814 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:15:40,814 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:40,815 INFO L225 Difference]: With dead ends: 351 [2025-04-13 23:15:40,815 INFO L226 Difference]: Without dead ends: 209 [2025-04-13 23:15:40,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:15:40,816 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:40,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:15:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-04-13 23:15:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-04-13 23:15:40,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.625) internal successors, (546), 208 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 546 transitions. [2025-04-13 23:15:40,838 INFO L79 Accepts]: Start accepts. Automaton has 209 states and 546 transitions. Word has length 22 [2025-04-13 23:15:40,839 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:40,839 INFO L485 AbstractCegarLoop]: Abstraction has 209 states and 546 transitions. [2025-04-13 23:15:40,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:40,839 INFO L278 IsEmpty]: Start isEmpty. Operand 209 states and 546 transitions. [2025-04-13 23:15:40,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:15:40,839 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:40,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:40,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:15:40,840 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:40,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:40,840 INFO L85 PathProgramCache]: Analyzing trace with hash -248412225, now seen corresponding path program 1 times [2025-04-13 23:15:40,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:40,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100635832] [2025-04-13 23:15:40,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:40,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:40,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:15:40,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:15:40,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:40,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:42,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100635832] [2025-04-13 23:15:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100635832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:42,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21543661] [2025-04-13 23:15:42,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:15:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:42,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:15:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:15:42,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:15:42,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:15:42,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:15:42,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:42,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:15:42,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:42,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:42,611 INFO L325 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-04-13 23:15:42,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 50 [2025-04-13 23:15:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21543661] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:42,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:42,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 27 [2025-04-13 23:15:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361628071] [2025-04-13 23:15:42,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:42,851 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:15:42,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:42,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:15:42,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2025-04-13 23:15:42,852 INFO L87 Difference]: Start difference. First operand 209 states and 546 transitions. Second operand has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:15:45,816 INFO L93 Difference]: Finished difference Result 2142 states and 5818 transitions. [2025-04-13 23:15:45,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:15:45,816 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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 23:15:45,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:15:45,824 INFO L225 Difference]: With dead ends: 2142 [2025-04-13 23:15:45,824 INFO L226 Difference]: Without dead ends: 1641 [2025-04-13 23:15:45,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1286, Invalid=5356, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:15:45,827 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 740 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:15:45,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 44 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:15:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2025-04-13 23:15:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 613. [2025-04-13 23:15:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 612 states have (on average 3.031045751633987) internal successors, (1855), 612 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1855 transitions. [2025-04-13 23:15:45,906 INFO L79 Accepts]: Start accepts. Automaton has 613 states and 1855 transitions. Word has length 22 [2025-04-13 23:15:45,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:15:45,906 INFO L485 AbstractCegarLoop]: Abstraction has 613 states and 1855 transitions. [2025-04-13 23:15:45,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.142857142857143) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:15:45,906 INFO L278 IsEmpty]: Start isEmpty. Operand 613 states and 1855 transitions. [2025-04-13 23:15:45,907 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:15:45,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:15:45,908 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:15:45,914 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 23:15:46,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 23:15:46,112 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:15:46,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:15:46,113 INFO L85 PathProgramCache]: Analyzing trace with hash -865255489, now seen corresponding path program 2 times [2025-04-13 23:15:46,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:15:46,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663135921] [2025-04-13 23:15:46,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:15:46,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:15:46,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:15:46,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:15:46,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:15:46,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:46,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:15:46,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663135921] [2025-04-13 23:15:46,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663135921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:15:46,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067257220] [2025-04-13 23:15:46,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:15:46,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:15:46,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:15:46,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:15:46,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:15:46,585 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:15:46,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:15:46,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:15:46,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:15:46,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 23:15:46,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:15:46,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:15:46,852 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-13 23:15:46,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-04-13 23:15:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:46,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:15:47,383 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 126 [2025-04-13 23:15:47,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:15:47,421 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 241 treesize of output 258 [2025-04-13 23:15:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:15:59,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067257220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:15:59,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:15:59,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2025-04-13 23:15:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666675177] [2025-04-13 23:15:59,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:15:59,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:15:59,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:15:59,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:15:59,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:15:59,137 INFO L87 Difference]: Start difference. First operand 613 states and 1855 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:00,987 INFO L93 Difference]: Finished difference Result 1748 states and 5299 transitions. [2025-04-13 23:16:00,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 23:16:00,987 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 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 23:16:00,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:00,993 INFO L225 Difference]: With dead ends: 1748 [2025-04-13 23:16:00,994 INFO L226 Difference]: Without dead ends: 1297 [2025-04-13 23:16:00,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=457, Invalid=2195, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 23:16:00,995 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 380 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:00,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 41 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:16:00,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2025-04-13 23:16:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 603. [2025-04-13 23:16:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 602 states have (on average 2.9335548172757475) internal successors, (1766), 602 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 23:16:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 1766 transitions. [2025-04-13 23:16:01,065 INFO L79 Accepts]: Start accepts. Automaton has 603 states and 1766 transitions. Word has length 22 [2025-04-13 23:16:01,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:01,065 INFO L485 AbstractCegarLoop]: Abstraction has 603 states and 1766 transitions. [2025-04-13 23:16:01,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 25 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:01,065 INFO L278 IsEmpty]: Start isEmpty. Operand 603 states and 1766 transitions. [2025-04-13 23:16:01,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:16:01,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:01,066 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:01,072 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 23:16:01,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:01,268 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:01,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:01,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1847417790, now seen corresponding path program 3 times [2025-04-13 23:16:01,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:01,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554858184] [2025-04-13 23:16:01,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:01,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:01,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-13 23:16:01,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:16:01,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:01,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:01,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:01,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554858184] [2025-04-13 23:16:01,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554858184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:01,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422098837] [2025-04-13 23:16:01,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:01,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:01,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:01,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:16:01,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:16:01,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-13 23:16:01,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:16:01,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:01,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:01,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:16:01,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:01,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:01,742 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:01,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-13 23:16:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:01,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422098837] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:01,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:01,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 16 [2025-04-13 23:16:01,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833302502] [2025-04-13 23:16:01,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:01,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:16:01,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:01,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:16:01,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:16:01,809 INFO L87 Difference]: Start difference. First operand 603 states and 1766 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23:16:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:02,220 INFO L93 Difference]: Finished difference Result 966 states and 2791 transitions. [2025-04-13 23:16:02,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:16:02,220 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23 [2025-04-13 23:16:02,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:02,225 INFO L225 Difference]: With dead ends: 966 [2025-04-13 23:16:02,225 INFO L226 Difference]: Without dead ends: 927 [2025-04-13 23:16:02,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:16:02,226 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 109 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:02,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 16 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:16:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-04-13 23:16:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 619. [2025-04-13 23:16:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 618 states have (on average 2.941747572815534) internal successors, (1818), 618 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1818 transitions. [2025-04-13 23:16:02,310 INFO L79 Accepts]: Start accepts. Automaton has 619 states and 1818 transitions. Word has length 23 [2025-04-13 23:16:02,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:02,310 INFO L485 AbstractCegarLoop]: Abstraction has 619 states and 1818 transitions. [2025-04-13 23:16:02,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23:16:02,310 INFO L278 IsEmpty]: Start isEmpty. Operand 619 states and 1818 transitions. [2025-04-13 23:16:02,312 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:16:02,312 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:02,312 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:02,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:16:02,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:02,516 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:02,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1464697402, now seen corresponding path program 4 times [2025-04-13 23:16:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:02,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978623879] [2025-04-13 23:16:02,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:02,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:16:02,537 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 23:16:02,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:02,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:02,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978623879] [2025-04-13 23:16:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978623879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:02,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326774088] [2025-04-13 23:16:02,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:02,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:02,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:16:02,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:16:02,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:16:02,778 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 23:16:02,778 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:02,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:02,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:16:02,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:02,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:02,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:02,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:02,965 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-13 23:16:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326774088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:03,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 16 [2025-04-13 23:16:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326301562] [2025-04-13 23:16:03,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:03,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:16:03,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:03,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:16:03,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:16:03,033 INFO L87 Difference]: Start difference. First operand 619 states and 1818 transitions. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23:16:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:03,328 INFO L93 Difference]: Finished difference Result 802 states and 2330 transitions. [2025-04-13 23:16:03,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:16:03,329 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23 [2025-04-13 23:16:03,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:03,332 INFO L225 Difference]: With dead ends: 802 [2025-04-13 23:16:03,332 INFO L226 Difference]: Without dead ends: 785 [2025-04-13 23:16:03,332 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:16:03,333 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 100 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:03,333 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 17 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:16:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-04-13 23:16:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 623. [2025-04-13 23:16:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 2.9389067524115755) internal successors, (1828), 622 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1828 transitions. [2025-04-13 23:16:03,400 INFO L79 Accepts]: Start accepts. Automaton has 623 states and 1828 transitions. Word has length 23 [2025-04-13 23:16:03,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:03,400 INFO L485 AbstractCegarLoop]: Abstraction has 623 states and 1828 transitions. [2025-04-13 23:16:03,400 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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 23:16:03,400 INFO L278 IsEmpty]: Start isEmpty. Operand 623 states and 1828 transitions. [2025-04-13 23:16:03,401 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:16:03,401 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:03,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:03,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:16:03,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:16:03,602 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:03,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:03,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1030651144, now seen corresponding path program 5 times [2025-04-13 23:16:03,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:03,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066583329] [2025-04-13 23:16:03,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:16:03,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:03,610 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 23:16:03,618 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:16:03,618 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:16:03,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:16:03,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:03,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066583329] [2025-04-13 23:16:03,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066583329] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:03,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738474686] [2025-04-13 23:16:03,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:16:03,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:03,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:03,666 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:16:03,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:16:03,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 3 equivalence classes. [2025-04-13 23:16:03,734 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:16:03,734 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:16:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:03,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:16:03,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 23:16:03,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:03,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738474686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:03,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:03,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-13 23:16:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800261122] [2025-04-13 23:16:03,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:03,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:16:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:03,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:16:03,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:16:03,834 INFO L87 Difference]: Start difference. First operand 623 states and 1828 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:04,074 INFO L93 Difference]: Finished difference Result 1167 states and 3542 transitions. [2025-04-13 23:16:04,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:16:04,074 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:16:04,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:04,079 INFO L225 Difference]: With dead ends: 1167 [2025-04-13 23:16:04,079 INFO L226 Difference]: Without dead ends: 1062 [2025-04-13 23:16:04,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:16:04,080 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 53 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:04,080 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 6 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-04-13 23:16:04,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 873. [2025-04-13 23:16:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 3.0240825688073394) internal successors, (2637), 872 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2637 transitions. [2025-04-13 23:16:04,207 INFO L79 Accepts]: Start accepts. Automaton has 873 states and 2637 transitions. Word has length 25 [2025-04-13 23:16:04,209 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:04,209 INFO L485 AbstractCegarLoop]: Abstraction has 873 states and 2637 transitions. [2025-04-13 23:16:04,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:04,209 INFO L278 IsEmpty]: Start isEmpty. Operand 873 states and 2637 transitions. [2025-04-13 23:16:04,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:16:04,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:04,212 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:04,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:16:04,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:04,412 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:04,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:04,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1788239094, now seen corresponding path program 1 times [2025-04-13 23:16:04,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:04,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115557569] [2025-04-13 23:16:04,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:04,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:16:04,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:05,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115557569] [2025-04-13 23:16:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115557569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:05,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375515554] [2025-04-13 23:16:05,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:05,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:05,128 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 23:16:05,129 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 23:16:05,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:16:05,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:05,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:05,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 23:16:05,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:05,539 INFO L325 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2025-04-13 23:16:05,539 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 49 treesize of output 18 [2025-04-13 23:16:05,546 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:05,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:05,909 INFO L325 Elim1Store]: treesize reduction 46, result has 55.3 percent of original size [2025-04-13 23:16:05,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 107 treesize of output 86 [2025-04-13 23:16:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:06,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375515554] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:06,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 23:16:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106518186] [2025-04-13 23:16:06,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:06,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 23:16:06,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:06,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 23:16:06,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1175, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:16:06,308 INFO L87 Difference]: Start difference. First operand 873 states and 2637 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:08,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:08,454 INFO L93 Difference]: Finished difference Result 2142 states and 6245 transitions. [2025-04-13 23:16:08,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:16:08,455 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:16:08,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:08,460 INFO L225 Difference]: With dead ends: 2142 [2025-04-13 23:16:08,460 INFO L226 Difference]: Without dead ends: 1156 [2025-04-13 23:16:08,463 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1038, Invalid=4662, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 23:16:08,463 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 434 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:08,463 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 72 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:16:08,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-04-13 23:16:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 595. [2025-04-13 23:16:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 2.8838383838383836) internal successors, (1713), 594 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1713 transitions. [2025-04-13 23:16:08,558 INFO L79 Accepts]: Start accepts. Automaton has 595 states and 1713 transitions. Word has length 27 [2025-04-13 23:16:08,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:08,558 INFO L485 AbstractCegarLoop]: Abstraction has 595 states and 1713 transitions. [2025-04-13 23:16:08,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:08,558 INFO L278 IsEmpty]: Start isEmpty. Operand 595 states and 1713 transitions. [2025-04-13 23:16:08,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:16:08,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:08,560 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:08,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:16:08,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:08,761 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:08,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:08,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1852883222, now seen corresponding path program 6 times [2025-04-13 23:16:08,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:08,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531063358] [2025-04-13 23:16:08,761 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:16:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:08,767 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 23:16:08,775 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 27 statements. [2025-04-13 23:16:08,775 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:16:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 23:16:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:08,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531063358] [2025-04-13 23:16:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531063358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:16:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761743144] [2025-04-13 23:16:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:08,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:16:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:16:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:16:08,831 INFO L87 Difference]: Start difference. First operand 595 states and 1713 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:08,950 INFO L93 Difference]: Finished difference Result 950 states and 2781 transitions. [2025-04-13 23:16:08,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:16:08,951 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:16:08,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:08,954 INFO L225 Difference]: With dead ends: 950 [2025-04-13 23:16:08,954 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 23:16:08,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:16:08,955 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:08,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:16:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 23:16:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 502. [2025-04-13 23:16:09,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 2.6746506986027945) internal successors, (1340), 501 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1340 transitions. [2025-04-13 23:16:09,026 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1340 transitions. Word has length 27 [2025-04-13 23:16:09,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:09,026 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1340 transitions. [2025-04-13 23:16:09,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:09,026 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1340 transitions. [2025-04-13 23:16:09,027 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:16:09,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:09,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:09,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 23:16:09,027 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:09,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1496661446, now seen corresponding path program 2 times [2025-04-13 23:16:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:09,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741449994] [2025-04-13 23:16:09,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:09,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:09,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:16:09,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:09,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:09,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:09,532 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:09,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:09,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741449994] [2025-04-13 23:16:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741449994] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:09,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285944362] [2025-04-13 23:16:09,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:09,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:09,535 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 23:16:09,536 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 23:16:09,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:16:09,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:09,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:09,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:09,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 23:16:09,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:09,700 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:16:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:09,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:10,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 152 [2025-04-13 23:16:10,711 INFO L325 Elim1Store]: treesize reduction 33, result has 68.0 percent of original size [2025-04-13 23:16:10,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 549 treesize of output 439 [2025-04-13 23:16:12,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285944362] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:12,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2025-04-13 23:16:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724925164] [2025-04-13 23:16:12,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:12,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:16:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:12,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:16:12,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:16:12,098 INFO L87 Difference]: Start difference. First operand 502 states and 1340 transitions. Second operand has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:14,197 INFO L93 Difference]: Finished difference Result 834 states and 2101 transitions. [2025-04-13 23:16:14,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 23:16:14,197 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:16:14,197 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:14,200 INFO L225 Difference]: With dead ends: 834 [2025-04-13 23:16:14,200 INFO L226 Difference]: Without dead ends: 788 [2025-04-13 23:16:14,201 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=800, Invalid=2982, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:16:14,202 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 259 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:14,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 66 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:16:14,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-04-13 23:16:14,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 591. [2025-04-13 23:16:14,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 2.623728813559322) internal successors, (1548), 590 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:14,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1548 transitions. [2025-04-13 23:16:14,291 INFO L79 Accepts]: Start accepts. Automaton has 591 states and 1548 transitions. Word has length 27 [2025-04-13 23:16:14,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:14,291 INFO L485 AbstractCegarLoop]: Abstraction has 591 states and 1548 transitions. [2025-04-13 23:16:14,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:14,291 INFO L278 IsEmpty]: Start isEmpty. Operand 591 states and 1548 transitions. [2025-04-13 23:16:14,292 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:16:14,292 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:14,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:14,299 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 23:16:14,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:16:14,497 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:16:14,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash -476261622, now seen corresponding path program 3 times [2025-04-13 23:16:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:14,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482967235] [2025-04-13 23:16:14,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:14,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:14,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 23:16:14,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:14,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:15,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482967235] [2025-04-13 23:16:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482967235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:15,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162044796] [2025-04-13 23:16:15,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:15,030 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 23:16:15,031 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 23:16:15,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 23:16:15,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:16:15,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:16:15,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:15,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 23:16:15,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:15,191 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 23:16:15,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:16:15,540 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-13 23:16:15,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:16:15,542 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:15,543 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 18 [2025-04-13 23:16:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:15,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:16,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 206 [2025-04-13 23:16:16,903 INFO L325 Elim1Store]: treesize reduction 10, result has 95.6 percent of original size [2025-04-13 23:16:16,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 573 treesize of output 614 [2025-04-13 23:18:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162044796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:06,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2025-04-13 23:18:06,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952602429] [2025-04-13 23:18:06,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:06,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 23:18:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:06,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 23:18:06,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1089, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:18:06,687 INFO L87 Difference]: Start difference. First operand 591 states and 1548 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:11,520 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 23:18:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:12,401 INFO L93 Difference]: Finished difference Result 715 states and 1798 transitions. [2025-04-13 23:18:12,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 23:18:12,402 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 23:18:12,402 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:12,405 INFO L225 Difference]: With dead ends: 715 [2025-04-13 23:18:12,405 INFO L226 Difference]: Without dead ends: 671 [2025-04-13 23:18:12,405 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 23:18:12,406 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 219 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 38 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:12,406 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 44 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 728 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-04-13 23:18:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-04-13 23:18:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 575. [2025-04-13 23:18:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 2.6341463414634148) internal successors, (1512), 574 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:12,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1512 transitions. [2025-04-13 23:18:12,493 INFO L79 Accepts]: Start accepts. Automaton has 575 states and 1512 transitions. Word has length 27 [2025-04-13 23:18:12,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:12,493 INFO L485 AbstractCegarLoop]: Abstraction has 575 states and 1512 transitions. [2025-04-13 23:18:12,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:18:12,494 INFO L278 IsEmpty]: Start isEmpty. Operand 575 states and 1512 transitions. [2025-04-13 23:18:12,494 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:18:12,494 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:12,494 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:12,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:18:12,697 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:18:12,698 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 23:18:12,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2080987914, now seen corresponding path program 4 times [2025-04-13 23:18:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:12,698 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955342738] [2025-04-13 23:18:12,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:18:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:12,704 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:18:12,714 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 23:18:12,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:18:12,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:13,163 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:13,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:13,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955342738] [2025-04-13 23:18:13,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955342738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:13,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766082944] [2025-04-13 23:18:13,164 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:18:13,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:13,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:13,166 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 23:18:13,167 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 23:18:13,219 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:18:13,235 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 23:18:13,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:18:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:13,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 23:18:13,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:13,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:18:13,721 INFO L325 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-04-13 23:18:13,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-04-13 23:18:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:13,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:14,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 188 [2025-04-13 23:18:14,970 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:18:14,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 534 treesize of output 590 [2025-04-13 23:18:56,285 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 23:18:56,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2025-04-13 23:18:56,286 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 23:18:56,292 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 23:18:56,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:18:56,487 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 77 more [2025-04-13 23:18:56,492 INFO L158 Benchmark]: Toolchain (without parser) took 200091.58ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 101.4MB in the beginning and 780.8MB in the end (delta: -679.4MB). Peak memory consumption was 544.9MB. Max. memory is 8.0GB. [2025-04-13 23:18:56,492 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:18:56,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.16ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 87.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:18:56,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 84.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:18:56,492 INFO L158 Benchmark]: Boogie Preprocessor took 31.73ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:18:56,493 INFO L158 Benchmark]: IcfgBuilder took 536.43ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 35.2MB in the end (delta: 47.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 23:18:56,493 INFO L158 Benchmark]: TraceAbstraction took 199254.23ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 34.3MB in the beginning and 780.8MB in the end (delta: -746.6MB). Peak memory consumption was 477.8MB. Max. memory is 8.0GB. [2025-04-13 23:18:56,493 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.14ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.16ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 87.1MB in the end (delta: 14.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.94ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 84.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.73ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 536.43ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 35.2MB in the end (delta: 47.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 199254.23ms. Allocated memory was 142.6MB in the beginning and 893.4MB in the end (delta: 750.8MB). Free memory was 34.3MB in the beginning and 780.8MB in the end (delta: -746.6MB). Peak memory consumption was 477.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...