/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-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:40:29,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:40:29,136 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 22:40:29,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:40:29,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:40:29,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:40:29,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:40:29,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:40:29,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:40:29,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:40:29,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:40:29,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:40:29,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:40:29,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:40:29,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:40:29,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:40:29,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:40:29,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:40:29,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:40:29,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:40:29,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:40:29,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:40:29,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:40:29,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:40:29,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:40:29,167 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 22:40:29,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:40:29,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:40:29,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:40:29,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:40:29,385 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:40:29,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 22:40:30,657 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a28152/fc88978caeba44d3a4c8f7bb254fc951/FLAGe14818e93 [2025-04-13 22:40:30,842 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:40:30,843 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 22:40:30,848 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a28152/fc88978caeba44d3a4c8f7bb254fc951/FLAGe14818e93 [2025-04-13 22:40:31,659 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f1a28152/fc88978caeba44d3a4c8f7bb254fc951 [2025-04-13 22:40:31,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:40:31,662 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:40:31,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:40:31,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:40:31,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:40:31,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:31,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d8b6475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31, skipping insertion in model container [2025-04-13 22:40:31,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:31,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:40:31,864 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-04-13 22:40:31,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:40:31,889 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:40:31,930 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2025-04-13 22:40:31,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:40:31,955 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:40:31,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31 WrapperNode [2025-04-13 22:40:31,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:40:31,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:40:31,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:40:31,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:40:31,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:31,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,003 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 289 [2025-04-13 22:40:32,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:40:32,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:40:32,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:40:32,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:40:32,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,040 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:40:32,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:40:32,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:40:32,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:40:32,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:40:32,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (1/1) ... [2025-04-13 22:40:32,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:40:32,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:32,079 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 22:40:32,084 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 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:40:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:40:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:40:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:40:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:40:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:40:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:40:32,102 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 22:40:32,200 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:40:32,201 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:40:32,557 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:40:32,558 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:40:32,558 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:40:32,863 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:40:32,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:40:32 BoogieIcfgContainer [2025-04-13 22:40:32,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:40:32,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:40:32,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:40:32,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:40:32,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:40:31" (1/3) ... [2025-04-13 22:40:32,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4b1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:40:32, skipping insertion in model container [2025-04-13 22:40:32,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:40:31" (2/3) ... [2025-04-13 22:40:32,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c4b1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:40:32, skipping insertion in model container [2025-04-13 22:40:32,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:40:32" (3/3) ... [2025-04-13 22:40:32,869 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2025-04-13 22:40:32,880 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:40:32,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt2.wvr.c that has 5 procedures, 42 locations, 43 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:40:32,881 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:40:32,934 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:40:32,955 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 47 transitions, 122 flow [2025-04-13 22:40:33,139 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:33,159 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:40:33,168 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;@730c026b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:40:33,168 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:40:33,180 INFO L278 IsEmpty]: Start isEmpty. Operand has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:33,212 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:40:33,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:33,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:33,214 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:33,218 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 684380333, now seen corresponding path program 1 times [2025-04-13 22:40:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:33,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214225668] [2025-04-13 22:40:33,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:33,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:40:33,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:40:33,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:33,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:33,720 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 22:40:33,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:33,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214225668] [2025-04-13 22:40:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214225668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:33,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:40:33,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669939028] [2025-04-13 22:40:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:33,727 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:40:33,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:33,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:40:33,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:33,749 INFO L87 Difference]: Start difference. First operand has 3372 states, 3371 states have (on average 4.338178582023138) internal successors, (14624), 3371 states have internal predecessors, (14624), 0 states have call successors, (0), 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 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:34,036 INFO L93 Difference]: Finished difference Result 5186 states and 22426 transitions. [2025-04-13 22:40:34,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:40:34,037 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 22:40:34,038 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:34,094 INFO L225 Difference]: With dead ends: 5186 [2025-04-13 22:40:34,095 INFO L226 Difference]: Without dead ends: 4408 [2025-04-13 22:40:34,104 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:34,107 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:34,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 27 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4408 states. [2025-04-13 22:40:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4408 to 3890. [2025-04-13 22:40:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3890 states, 3889 states have (on average 4.344561583954744) internal successors, (16896), 3889 states have internal predecessors, (16896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 16896 transitions. [2025-04-13 22:40:34,432 INFO L79 Accepts]: Start accepts. Automaton has 3890 states and 16896 transitions. Word has length 28 [2025-04-13 22:40:34,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:34,432 INFO L485 AbstractCegarLoop]: Abstraction has 3890 states and 16896 transitions. [2025-04-13 22:40:34,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:34,432 INFO L278 IsEmpty]: Start isEmpty. Operand 3890 states and 16896 transitions. [2025-04-13 22:40:34,448 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:40:34,448 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:34,448 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:34,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:40:34,449 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:34,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:34,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1846640627, now seen corresponding path program 1 times [2025-04-13 22:40:34,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:34,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713666502] [2025-04-13 22:40:34,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:34,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:34,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:40:34,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:40:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:34,680 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 22:40:34,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:34,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713666502] [2025-04-13 22:40:34,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713666502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:34,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:34,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:40:34,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188803330] [2025-04-13 22:40:34,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:34,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:40:34,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:34,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:40:34,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:40:34,683 INFO L87 Difference]: Start difference. First operand 3890 states and 16896 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:35,056 INFO L93 Difference]: Finished difference Result 8969 states and 39039 transitions. [2025-04-13 22:40:35,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:40:35,057 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:40:35,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:35,087 INFO L225 Difference]: With dead ends: 8969 [2025-04-13 22:40:35,087 INFO L226 Difference]: Without dead ends: 3891 [2025-04-13 22:40:35,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:35,098 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:35,098 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:35,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2025-04-13 22:40:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3891. [2025-04-13 22:40:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3890 states have (on average 4.343701799485861) internal successors, (16897), 3890 states have internal predecessors, (16897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 16897 transitions. [2025-04-13 22:40:35,244 INFO L79 Accepts]: Start accepts. Automaton has 3891 states and 16897 transitions. Word has length 31 [2025-04-13 22:40:35,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:35,244 INFO L485 AbstractCegarLoop]: Abstraction has 3891 states and 16897 transitions. [2025-04-13 22:40:35,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:35,244 INFO L278 IsEmpty]: Start isEmpty. Operand 3891 states and 16897 transitions. [2025-04-13 22:40:35,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:40:35,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:35,256 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:35,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:40:35,256 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:35,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 236961351, now seen corresponding path program 1 times [2025-04-13 22:40:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:35,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168267099] [2025-04-13 22:40:35,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:35,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:40:35,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:40:35,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:35,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:35,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168267099] [2025-04-13 22:40:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168267099] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:35,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:40:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701021342] [2025-04-13 22:40:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:35,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:40:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:35,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:40:35,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:35,470 INFO L87 Difference]: Start difference. First operand 3891 states and 16897 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:35,775 INFO L93 Difference]: Finished difference Result 5845 states and 25495 transitions. [2025-04-13 22:40:35,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:40:35,776 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:40:35,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:35,832 INFO L225 Difference]: With dead ends: 5845 [2025-04-13 22:40:35,832 INFO L226 Difference]: Without dead ends: 5207 [2025-04-13 22:40:35,836 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:40:35,837 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:35,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 42 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-04-13 22:40:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 4451. [2025-04-13 22:40:36,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4451 states, 4450 states have (on average 4.344044943820225) internal successors, (19331), 4450 states have internal predecessors, (19331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4451 states to 4451 states and 19331 transitions. [2025-04-13 22:40:36,082 INFO L79 Accepts]: Start accepts. Automaton has 4451 states and 19331 transitions. Word has length 32 [2025-04-13 22:40:36,083 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:36,083 INFO L485 AbstractCegarLoop]: Abstraction has 4451 states and 19331 transitions. [2025-04-13 22:40:36,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:36,083 INFO L278 IsEmpty]: Start isEmpty. Operand 4451 states and 19331 transitions. [2025-04-13 22:40:36,095 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:40:36,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:36,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:36,096 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:40:36,096 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:36,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 495746735, now seen corresponding path program 2 times [2025-04-13 22:40:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:36,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442405004] [2025-04-13 22:40:36,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:40:36,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:36,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-13 22:40:36,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 31 of 32 statements. [2025-04-13 22:40:36,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:40:36,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:36,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442405004] [2025-04-13 22:40:36,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442405004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:36,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:36,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:40:36,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996518584] [2025-04-13 22:40:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:36,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:40:36,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:36,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:40:36,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:36,273 INFO L87 Difference]: Start difference. First operand 4451 states and 19331 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:36,772 INFO L93 Difference]: Finished difference Result 7869 states and 34209 transitions. [2025-04-13 22:40:36,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:40:36,773 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 22:40:36,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:36,817 INFO L225 Difference]: With dead ends: 7869 [2025-04-13 22:40:36,817 INFO L226 Difference]: Without dead ends: 7483 [2025-04-13 22:40:36,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:40:36,823 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:36,823 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 46 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:40:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2025-04-13 22:40:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 4829. [2025-04-13 22:40:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4829 states, 4828 states have (on average 4.345691797845899) internal successors, (20981), 4828 states have internal predecessors, (20981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4829 states to 4829 states and 20981 transitions. [2025-04-13 22:40:37,109 INFO L79 Accepts]: Start accepts. Automaton has 4829 states and 20981 transitions. Word has length 32 [2025-04-13 22:40:37,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:37,109 INFO L485 AbstractCegarLoop]: Abstraction has 4829 states and 20981 transitions. [2025-04-13 22:40:37,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:37,110 INFO L278 IsEmpty]: Start isEmpty. Operand 4829 states and 20981 transitions. [2025-04-13 22:40:37,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:40:37,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:37,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:37,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:40:37,124 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:37,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:37,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1680986081, now seen corresponding path program 1 times [2025-04-13 22:40:37,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:37,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93056227] [2025-04-13 22:40:37,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:37,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:40:37,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:40:37,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:37,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:37,755 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 22:40:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:37,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93056227] [2025-04-13 22:40:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93056227] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:37,756 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625522681] [2025-04-13 22:40:37,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:37,760 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 22:40:37,763 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 22:40:37,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:40:37,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:40:37,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:37,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:37,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:40:37,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:37,978 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 22:40:38,167 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 15 treesize of output 7 [2025-04-13 22:40:38,180 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 22:40:38,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:38,567 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 39 treesize of output 35 [2025-04-13 22:40:38,571 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 35 [2025-04-13 22:40:38,624 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 22:40:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625522681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:38,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:38,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 22:40:38,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178608724] [2025-04-13 22:40:38,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:38,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:40:38,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:38,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:40:38,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:40:38,627 INFO L87 Difference]: Start difference. First operand 4829 states and 20981 transitions. Second operand has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:41,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:41,815 INFO L93 Difference]: Finished difference Result 22599 states and 98081 transitions. [2025-04-13 22:40:41,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:40:41,816 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 22:40:41,816 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:41,901 INFO L225 Difference]: With dead ends: 22599 [2025-04-13 22:40:41,901 INFO L226 Difference]: Without dead ends: 18015 [2025-04-13 22:40:41,914 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:40:41,915 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 454 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:41,915 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 306 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:40:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18015 states. [2025-04-13 22:40:43,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18015 to 10185. [2025-04-13 22:40:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10185 states, 10184 states have (on average 4.324037706205813) internal successors, (44036), 10184 states have internal predecessors, (44036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10185 states to 10185 states and 44036 transitions. [2025-04-13 22:40:43,204 INFO L79 Accepts]: Start accepts. Automaton has 10185 states and 44036 transitions. Word has length 35 [2025-04-13 22:40:43,206 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:43,206 INFO L485 AbstractCegarLoop]: Abstraction has 10185 states and 44036 transitions. [2025-04-13 22:40:43,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:43,206 INFO L278 IsEmpty]: Start isEmpty. Operand 10185 states and 44036 transitions. [2025-04-13 22:40:43,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 22:40:43,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:43,231 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:43,239 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 22:40:43,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:43,432 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:43,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1192370753, now seen corresponding path program 1 times [2025-04-13 22:40:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:43,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630507345] [2025-04-13 22:40:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:43,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:40:43,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:40:43,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:43,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:44,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630507345] [2025-04-13 22:40:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630507345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:44,187 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125933923] [2025-04-13 22:40:44,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:44,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:44,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:44,189 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 22:40:44,189 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 22:40:44,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 22:40:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 22:40:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:44,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 22:40:44,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:44,373 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 23 treesize of output 7 [2025-04-13 22:40:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:40:44,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:40:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125933923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:44,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:40:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-04-13 22:40:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667093343] [2025-04-13 22:40:44,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:44,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:40:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:40:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:40:44,388 INFO L87 Difference]: Start difference. First operand 10185 states and 44036 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:46,541 INFO L93 Difference]: Finished difference Result 18528 states and 80482 transitions. [2025-04-13 22:40:46,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:40:46,543 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 22:40:46,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:46,615 INFO L225 Difference]: With dead ends: 18528 [2025-04-13 22:40:46,615 INFO L226 Difference]: Without dead ends: 15187 [2025-04-13 22:40:46,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:40:46,628 INFO L437 NwaCegarLoop]: 21 mSDtfsCounter, 46 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:46,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 73 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15187 states. [2025-04-13 22:40:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15187 to 9033. [2025-04-13 22:40:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9033 states, 9032 states have (on average 4.317205491585474) internal successors, (38993), 9032 states have internal predecessors, (38993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9033 states to 9033 states and 38993 transitions. [2025-04-13 22:40:47,685 INFO L79 Accepts]: Start accepts. Automaton has 9033 states and 38993 transitions. Word has length 37 [2025-04-13 22:40:47,686 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:47,686 INFO L485 AbstractCegarLoop]: Abstraction has 9033 states and 38993 transitions. [2025-04-13 22:40:47,686 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:47,686 INFO L278 IsEmpty]: Start isEmpty. Operand 9033 states and 38993 transitions. [2025-04-13 22:40:47,705 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:40:47,706 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:47,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:47,713 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 22:40:47,907 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,SelfDestructingSolverStorable5 [2025-04-13 22:40:47,907 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:47,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash -242149871, now seen corresponding path program 1 times [2025-04-13 22:40:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:47,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235597247] [2025-04-13 22:40:47,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:47,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:40:47,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:40:47,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:47,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:47,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:47,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235597247] [2025-04-13 22:40:47,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235597247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:47,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:47,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:40:47,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591177555] [2025-04-13 22:40:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:47,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:40:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:47,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:40:47,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:40:47,971 INFO L87 Difference]: Start difference. First operand 9033 states and 38993 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:49,504 INFO L93 Difference]: Finished difference Result 14953 states and 64667 transitions. [2025-04-13 22:40:49,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:40:49,506 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 22:40:49,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:49,557 INFO L225 Difference]: With dead ends: 14953 [2025-04-13 22:40:49,557 INFO L226 Difference]: Without dead ends: 11663 [2025-04-13 22:40:49,564 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:40:49,564 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:49,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:49,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11663 states. [2025-04-13 22:40:51,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11663 to 11208. [2025-04-13 22:40:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11208 states, 11207 states have (on average 4.290621932720621) internal successors, (48085), 11207 states have internal predecessors, (48085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11208 states to 11208 states and 48085 transitions. [2025-04-13 22:40:51,114 INFO L79 Accepts]: Start accepts. Automaton has 11208 states and 48085 transitions. Word has length 38 [2025-04-13 22:40:51,114 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:51,114 INFO L485 AbstractCegarLoop]: Abstraction has 11208 states and 48085 transitions. [2025-04-13 22:40:51,114 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:51,115 INFO L278 IsEmpty]: Start isEmpty. Operand 11208 states and 48085 transitions. [2025-04-13 22:40:51,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:40:51,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:51,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:51,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:40:51,138 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:51,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:51,138 INFO L85 PathProgramCache]: Analyzing trace with hash 36390515, now seen corresponding path program 2 times [2025-04-13 22:40:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:51,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421054579] [2025-04-13 22:40:51,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:40:51,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:51,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-04-13 22:40:51,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:40:51,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:40:51,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:51,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421054579] [2025-04-13 22:40:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421054579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:40:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865423756] [2025-04-13 22:40:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:51,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:40:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:51,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:40:51,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:40:51,213 INFO L87 Difference]: Start difference. First operand 11208 states and 48085 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:53,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:53,928 INFO L93 Difference]: Finished difference Result 26666 states and 115368 transitions. [2025-04-13 22:40:53,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:40:53,928 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 39 [2025-04-13 22:40:53,928 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:54,014 INFO L225 Difference]: With dead ends: 26666 [2025-04-13 22:40:54,014 INFO L226 Difference]: Without dead ends: 21201 [2025-04-13 22:40:54,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:40:54,030 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:54,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 22 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:40:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21201 states. [2025-04-13 22:40:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21201 to 18719. [2025-04-13 22:40:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18719 states, 18718 states have (on average 4.3996687680307724) internal successors, (82353), 18718 states have internal predecessors, (82353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18719 states to 18719 states and 82353 transitions. [2025-04-13 22:40:56,570 INFO L79 Accepts]: Start accepts. Automaton has 18719 states and 82353 transitions. Word has length 39 [2025-04-13 22:40:56,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:56,571 INFO L485 AbstractCegarLoop]: Abstraction has 18719 states and 82353 transitions. [2025-04-13 22:40:56,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:56,571 INFO L278 IsEmpty]: Start isEmpty. Operand 18719 states and 82353 transitions. [2025-04-13 22:40:56,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:40:56,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:56,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:56,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:40:56,612 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:56,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1018609057, now seen corresponding path program 1 times [2025-04-13 22:40:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:56,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945462087] [2025-04-13 22:40:56,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:56,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:56,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:40:56,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:40:56,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:56,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:40:56,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:56,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945462087] [2025-04-13 22:40:56,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945462087] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:56,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:40:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349749506] [2025-04-13 22:40:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:56,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:40:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:56,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:40:56,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:40:56,685 INFO L87 Difference]: Start difference. First operand 18719 states and 82353 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:00,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:00,775 INFO L93 Difference]: Finished difference Result 38107 states and 167004 transitions. [2025-04-13 22:41:00,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:41:00,776 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 22:41:00,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:00,908 INFO L225 Difference]: With dead ends: 38107 [2025-04-13 22:41:00,908 INFO L226 Difference]: Without dead ends: 23513 [2025-04-13 22:41:00,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 22:41:00,933 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:00,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23513 states. [2025-04-13 22:41:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23513 to 22032. [2025-04-13 22:41:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22032 states, 22031 states have (on average 4.360083518678226) internal successors, (96057), 22031 states have internal predecessors, (96057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22032 states to 22032 states and 96057 transitions. [2025-04-13 22:41:03,706 INFO L79 Accepts]: Start accepts. Automaton has 22032 states and 96057 transitions. Word has length 41 [2025-04-13 22:41:03,706 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:03,706 INFO L485 AbstractCegarLoop]: Abstraction has 22032 states and 96057 transitions. [2025-04-13 22:41:03,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:03,706 INFO L278 IsEmpty]: Start isEmpty. Operand 22032 states and 96057 transitions. [2025-04-13 22:41:03,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:41:03,750 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:03,750 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:03,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:41:03,750 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:41:03,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash -812383689, now seen corresponding path program 3 times [2025-04-13 22:41:03,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:03,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655045923] [2025-04-13 22:41:03,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:03,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:03,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-13 22:41:03,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:41:03,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:41:03,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:04,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:04,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655045923] [2025-04-13 22:41:04,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655045923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:04,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661263740] [2025-04-13 22:41:04,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:04,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:04,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:04,428 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 22:41:04,430 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 22:41:04,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-13 22:41:04,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:41:04,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:41:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:41:04,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:04,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:41:04,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:04,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-04-13 22:41:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:04,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:05,492 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 92 treesize of output 82 [2025-04-13 22:41:05,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:05,501 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 190 treesize of output 131 [2025-04-13 22:41:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:05,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661263740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:05,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:05,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 28 [2025-04-13 22:41:05,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264836087] [2025-04-13 22:41:05,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:05,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:41:05,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:05,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:41:05,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:41:05,624 INFO L87 Difference]: Start difference. First operand 22032 states and 96057 transitions. Second operand has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 29 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:34,103 INFO L93 Difference]: Finished difference Result 119495 states and 511940 transitions. [2025-04-13 22:41:34,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 22:41:34,104 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 29 states have internal predecessors, (115), 0 states have call successors, (0), 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 42 [2025-04-13 22:41:34,104 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:34,662 INFO L225 Difference]: With dead ends: 119495 [2025-04-13 22:41:34,662 INFO L226 Difference]: Without dead ends: 109143 [2025-04-13 22:41:34,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1149 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=922, Invalid=3238, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:41:34,712 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 1782 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 3225 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 3343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:34,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1782 Valid, 843 Invalid, 3343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3225 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 22:41:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109143 states. [2025-04-13 22:41:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109143 to 43857. [2025-04-13 22:41:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43857 states, 43856 states have (on average 4.473891827800073) internal successors, (196207), 43856 states have internal predecessors, (196207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43857 states to 43857 states and 196207 transitions. [2025-04-13 22:41:46,032 INFO L79 Accepts]: Start accepts. Automaton has 43857 states and 196207 transitions. Word has length 42 [2025-04-13 22:41:46,032 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:46,032 INFO L485 AbstractCegarLoop]: Abstraction has 43857 states and 196207 transitions. [2025-04-13 22:41:46,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9655172413793105) internal successors, (115), 29 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:41:46,033 INFO L278 IsEmpty]: Start isEmpty. Operand 43857 states and 196207 transitions. [2025-04-13 22:41:46,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:41:46,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:46,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:41:46,158 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 22:41:46,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:46,353 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:41:46,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 315169833, now seen corresponding path program 4 times [2025-04-13 22:41:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:46,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359281294] [2025-04-13 22:41:46,353 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:41:46,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:46,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:41:46,382 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:41:46,382 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:41:46,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:47,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:47,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359281294] [2025-04-13 22:41:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359281294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:47,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495017194] [2025-04-13 22:41:47,314 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:41:47,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:47,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:47,316 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 22:41:47,317 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 22:41:47,373 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:41:47,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:41:47,399 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:41:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:47,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:41:47,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:47,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:41:47,828 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:47,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-04-13 22:41:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:47,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:48,388 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 92 treesize of output 82 [2025-04-13 22:41:48,393 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:48,394 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 182 treesize of output 123 [2025-04-13 22:41:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:48,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495017194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:48,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2025-04-13 22:41:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040324921] [2025-04-13 22:41:48,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:48,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:41:48,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:48,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:41:48,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:41:48,478 INFO L87 Difference]: Start difference. First operand 43857 states and 196207 transitions. Second operand has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:42:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:42:48,859 INFO L93 Difference]: Finished difference Result 145762 states and 637632 transitions. [2025-04-13 22:42:48,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 22:42:48,860 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 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 42 [2025-04-13 22:42:48,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:42:49,528 INFO L225 Difference]: With dead ends: 145762 [2025-04-13 22:42:49,528 INFO L226 Difference]: Without dead ends: 126926 [2025-04-13 22:42:49,593 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=867, Invalid=2793, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:42:49,593 INFO L437 NwaCegarLoop]: 86 mSDtfsCounter, 1144 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 3689 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:42:49,593 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1069 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3689 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 22:42:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126926 states. [2025-04-13 22:43:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126926 to 68650. [2025-04-13 22:43:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68650 states, 68649 states have (on average 4.4925199201736365) internal successors, (308407), 68649 states have internal predecessors, (308407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68650 states to 68650 states and 308407 transitions. [2025-04-13 22:43:10,281 INFO L79 Accepts]: Start accepts. Automaton has 68650 states and 308407 transitions. Word has length 42 [2025-04-13 22:43:10,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:10,281 INFO L485 AbstractCegarLoop]: Abstraction has 68650 states and 308407 transitions. [2025-04-13 22:43:10,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.066666666666666) internal successors, (122), 30 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:10,281 INFO L278 IsEmpty]: Start isEmpty. Operand 68650 states and 308407 transitions. [2025-04-13 22:43:10,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:43:10,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:10,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:10,447 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 22:43:10,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:10,641 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:43:10,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:10,641 INFO L85 PathProgramCache]: Analyzing trace with hash 728606983, now seen corresponding path program 1 times [2025-04-13 22:43:10,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:10,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961623770] [2025-04-13 22:43:10,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:43:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:43:10,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:43:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:43:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:10,862 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 22:43:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:10,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961623770] [2025-04-13 22:43:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961623770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:43:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:43:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:43:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168501553] [2025-04-13 22:43:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:43:10,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:43:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:10,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:43:10,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:43:10,864 INFO L87 Difference]: Start difference. First operand 68650 states and 308407 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:43:42,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:42,775 INFO L93 Difference]: Finished difference Result 85044 states and 374812 transitions. [2025-04-13 22:43:42,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:43:42,776 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:43:42,776 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:43,470 INFO L225 Difference]: With dead ends: 85044 [2025-04-13 22:43:43,471 INFO L226 Difference]: Without dead ends: 84590 [2025-04-13 22:43:43,516 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:43:43,518 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 249 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:43,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 200 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:43:43,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84590 states. [2025-04-13 22:44:07,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84590 to 69914. [2025-04-13 22:44:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69914 states, 69913 states have (on average 4.492540729191996) internal successors, (314087), 69913 states have internal predecessors, (314087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69914 states to 69914 states and 314087 transitions. [2025-04-13 22:44:08,619 INFO L79 Accepts]: Start accepts. Automaton has 69914 states and 314087 transitions. Word has length 42 [2025-04-13 22:44:08,621 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:08,621 INFO L485 AbstractCegarLoop]: Abstraction has 69914 states and 314087 transitions. [2025-04-13 22:44:08,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:08,621 INFO L278 IsEmpty]: Start isEmpty. Operand 69914 states and 314087 transitions. [2025-04-13 22:44:08,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:44:08,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:08,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:08,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 22:44:08,973 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:44:08,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:08,974 INFO L85 PathProgramCache]: Analyzing trace with hash 126897499, now seen corresponding path program 2 times [2025-04-13 22:44:08,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:08,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077678554] [2025-04-13 22:44:08,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:08,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:09,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:44:09,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 22:44:09,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:44:09,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:09,664 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 22:44:09,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:09,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077678554] [2025-04-13 22:44:09,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077678554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:09,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:44:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685436158] [2025-04-13 22:44:09,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:09,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:44:09,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:09,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:44:09,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:44:09,665 INFO L87 Difference]: Start difference. First operand 69914 states and 314087 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:44:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:42,716 INFO L93 Difference]: Finished difference Result 80359 states and 359526 transitions. [2025-04-13 22:44:42,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:44:42,717 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:44:42,717 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:43,486 INFO L225 Difference]: With dead ends: 80359 [2025-04-13 22:44:43,487 INFO L226 Difference]: Without dead ends: 79497 [2025-04-13 22:44:43,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:44:43,529 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 203 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:43,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 155 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:44:43,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79497 states. [2025-04-13 22:45:07,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79497 to 72346. [2025-04-13 22:45:07,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72346 states, 72345 states have (on average 4.491464510332435) internal successors, (324935), 72345 states have internal predecessors, (324935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72346 states to 72346 states and 324935 transitions. [2025-04-13 22:45:07,792 INFO L79 Accepts]: Start accepts. Automaton has 72346 states and 324935 transitions. Word has length 42 [2025-04-13 22:45:07,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:07,793 INFO L485 AbstractCegarLoop]: Abstraction has 72346 states and 324935 transitions. [2025-04-13 22:45:07,793 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:07,793 INFO L278 IsEmpty]: Start isEmpty. Operand 72346 states and 324935 transitions. [2025-04-13 22:45:08,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:45:08,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:08,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:08,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:45:08,024 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:45:08,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1379638519, now seen corresponding path program 3 times [2025-04-13 22:45:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:08,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896601361] [2025-04-13 22:45:08,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:45:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:08,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:45:08,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 22:45:08,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:45:08,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:08,772 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 22:45:08,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:08,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896601361] [2025-04-13 22:45:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896601361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:45:08,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:45:08,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:45:08,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883692905] [2025-04-13 22:45:08,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:45:08,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:45:08,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:08,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:45:08,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:45:08,773 INFO L87 Difference]: Start difference. First operand 72346 states and 324935 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:46,889 INFO L93 Difference]: Finished difference Result 89334 states and 397132 transitions. [2025-04-13 22:45:46,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:45:46,890 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:45:46,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:47,629 INFO L225 Difference]: With dead ends: 89334 [2025-04-13 22:45:47,629 INFO L226 Difference]: Without dead ends: 88766 [2025-04-13 22:45:47,664 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-04-13 22:45:47,667 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 191 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:47,667 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 104 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:45:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88766 states. [2025-04-13 22:46:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88766 to 73627. [2025-04-13 22:46:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73627 states, 73626 states have (on average 4.506492271751827) internal successors, (331795), 73626 states have internal predecessors, (331795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73627 states to 73627 states and 331795 transitions. [2025-04-13 22:46:12,891 INFO L79 Accepts]: Start accepts. Automaton has 73627 states and 331795 transitions. Word has length 42 [2025-04-13 22:46:12,891 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:46:12,892 INFO L485 AbstractCegarLoop]: Abstraction has 73627 states and 331795 transitions. [2025-04-13 22:46:12,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:12,892 INFO L278 IsEmpty]: Start isEmpty. Operand 73627 states and 331795 transitions. [2025-04-13 22:46:13,085 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:46:13,085 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:46:13,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:46:13,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 22:46:13,086 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:46:13,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:46:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1446334457, now seen corresponding path program 4 times [2025-04-13 22:46:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:46:13,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255198038] [2025-04-13 22:46:13,090 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:46:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:46:13,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:46:13,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:46:13,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:46:13,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:46:13,684 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 22:46:13,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:46:13,685 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255198038] [2025-04-13 22:46:13,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255198038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:46:13,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:46:13,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:46:13,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360807100] [2025-04-13 22:46:13,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:46:13,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:46:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:46:13,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:46:13,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:46:13,690 INFO L87 Difference]: Start difference. First operand 73627 states and 331795 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:46:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:46:57,798 INFO L93 Difference]: Finished difference Result 106006 states and 460768 transitions. [2025-04-13 22:46:57,798 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:46:57,798 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:46:57,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:46:58,370 INFO L225 Difference]: With dead ends: 106006 [2025-04-13 22:46:58,370 INFO L226 Difference]: Without dead ends: 105521 [2025-04-13 22:46:58,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:46:58,411 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 237 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:46:58,412 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 148 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:46:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105521 states. [2025-04-13 22:47:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105521 to 73627. [2025-04-13 22:47:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73627 states, 73626 states have (on average 4.506329285850107) internal successors, (331783), 73626 states have internal predecessors, (331783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73627 states to 73627 states and 331783 transitions. [2025-04-13 22:47:23,791 INFO L79 Accepts]: Start accepts. Automaton has 73627 states and 331783 transitions. Word has length 42 [2025-04-13 22:47:23,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:23,791 INFO L485 AbstractCegarLoop]: Abstraction has 73627 states and 331783 transitions. [2025-04-13 22:47:23,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:23,791 INFO L278 IsEmpty]: Start isEmpty. Operand 73627 states and 331783 transitions. [2025-04-13 22:47:23,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:47:23,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:23,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:23,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 22:47:23,964 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:47:23,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2062062499, now seen corresponding path program 5 times [2025-04-13 22:47:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:23,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771174758] [2025-04-13 22:47:23,964 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:47:23,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:23,981 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:47:23,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:47:23,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:47:23,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:24,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:47:24,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:24,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771174758] [2025-04-13 22:47:24,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771174758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:47:24,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:47:24,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:47:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377099748] [2025-04-13 22:47:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:47:24,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:47:24,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:24,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:47:24,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:47:24,140 INFO L87 Difference]: Start difference. First operand 73627 states and 331783 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:47:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:59,074 INFO L93 Difference]: Finished difference Result 86930 states and 387197 transitions. [2025-04-13 22:47:59,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:47:59,074 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:47:59,075 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:59,507 INFO L225 Difference]: With dead ends: 86930 [2025-04-13 22:47:59,507 INFO L226 Difference]: Without dead ends: 85668 [2025-04-13 22:47:59,537 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:47:59,538 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 217 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:59,538 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 118 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:47:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85668 states. [2025-04-13 22:48:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85668 to 75460. [2025-04-13 22:48:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75460 states, 75459 states have (on average 4.502100478405492) internal successors, (339724), 75459 states have internal predecessors, (339724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:48:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75460 states to 75460 states and 339724 transitions. [2025-04-13 22:48:25,523 INFO L79 Accepts]: Start accepts. Automaton has 75460 states and 339724 transitions. Word has length 42 [2025-04-13 22:48:25,523 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:48:25,523 INFO L485 AbstractCegarLoop]: Abstraction has 75460 states and 339724 transitions. [2025-04-13 22:48:25,523 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:48:25,523 INFO L278 IsEmpty]: Start isEmpty. Operand 75460 states and 339724 transitions. [2025-04-13 22:48:25,682 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:48:25,682 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:48:25,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:48:25,683 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 22:48:25,683 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:48:25,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:48:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash -694577955, now seen corresponding path program 6 times [2025-04-13 22:48:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:48:25,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559820331] [2025-04-13 22:48:25,684 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:48:25,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:48:25,699 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:48:25,717 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 22:48:25,717 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:48:25,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:48:25,878 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 22:48:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:48:25,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559820331] [2025-04-13 22:48:25,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559820331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:48:25,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:48:25,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 22:48:25,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457729950] [2025-04-13 22:48:25,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:48:25,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:48:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:48:25,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:48:25,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:48:25,879 INFO L87 Difference]: Start difference. First operand 75460 states and 339724 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:49:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:49:01,405 INFO L93 Difference]: Finished difference Result 83580 states and 375100 transitions. [2025-04-13 22:49:01,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:49:01,405 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:49:01,405 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:49:02,088 INFO L225 Difference]: With dead ends: 83580 [2025-04-13 22:49:02,088 INFO L226 Difference]: Without dead ends: 82952 [2025-04-13 22:49:02,120 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:49:02,121 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:49:02,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 117 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:49:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82952 states. [2025-04-13 22:49:28,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82952 to 75328. [2025-04-13 22:49:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75328 states, 75327 states have (on average 4.5004845540111775) internal successors, (339008), 75327 states have internal predecessors, (339008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:49:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75328 states to 75328 states and 339008 transitions. [2025-04-13 22:49:29,576 INFO L79 Accepts]: Start accepts. Automaton has 75328 states and 339008 transitions. Word has length 42 [2025-04-13 22:49:29,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:49:29,577 INFO L485 AbstractCegarLoop]: Abstraction has 75328 states and 339008 transitions. [2025-04-13 22:49:29,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:49:29,577 INFO L278 IsEmpty]: Start isEmpty. Operand 75328 states and 339008 transitions. [2025-04-13 22:49:29,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:49:29,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:49:29,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:49:29,737 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 22:49:29,737 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:49:29,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:49:29,738 INFO L85 PathProgramCache]: Analyzing trace with hash -318118201, now seen corresponding path program 7 times [2025-04-13 22:49:29,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:49:29,738 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541078969] [2025-04-13 22:49:29,738 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:49:29,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:49:29,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:49:29,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:49:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:49:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:29,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:49:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:49:29,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541078969] [2025-04-13 22:49:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541078969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:29,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640645147] [2025-04-13 22:49:29,913 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:49:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:49:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:49:29,915 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 22:49:29,917 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 22:49:29,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-13 22:49:30,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-13 22:49:30,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:49:30,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:49:30,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 22:49:30,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:49:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:49:30,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:49:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:49:30,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640645147] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 22:49:30,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 22:49:30,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 8] total 23 [2025-04-13 22:49:30,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066855204] [2025-04-13 22:49:30,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:49:30,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:49:30,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:49:30,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:49:30,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:49:30,953 INFO L87 Difference]: Start difference. First operand 75328 states and 339008 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:26,604 INFO L93 Difference]: Finished difference Result 105430 states and 466802 transitions. [2025-04-13 22:50:26,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 22:50:26,605 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:50:26,605 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:27,148 INFO L225 Difference]: With dead ends: 105430 [2025-04-13 22:50:27,148 INFO L226 Difference]: Without dead ends: 104340 [2025-04-13 22:50:27,185 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1660 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=890, Invalid=4366, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 22:50:27,186 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 468 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:27,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 322 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:50:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104340 states. [2025-04-13 22:50:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104340 to 78233. [2025-04-13 22:50:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78233 states, 78232 states have (on average 4.5420416197975255) internal successors, (355333), 78232 states have internal predecessors, (355333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78233 states to 78233 states and 355333 transitions. [2025-04-13 22:50:57,027 INFO L79 Accepts]: Start accepts. Automaton has 78233 states and 355333 transitions. Word has length 42 [2025-04-13 22:50:57,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:57,027 INFO L485 AbstractCegarLoop]: Abstraction has 78233 states and 355333 transitions. [2025-04-13 22:50:57,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 10 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:50:57,027 INFO L278 IsEmpty]: Start isEmpty. Operand 78233 states and 355333 transitions. [2025-04-13 22:50:57,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 22:50:57,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:57,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:57,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 22:50:57,416 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,SelfDestructingSolverStorable17 [2025-04-13 22:50:57,417 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:50:57,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 76269513, now seen corresponding path program 8 times [2025-04-13 22:50:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:57,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916949239] [2025-04-13 22:50:57,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:50:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:57,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-13 22:50:57,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 22:50:57,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:50:57,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:57,615 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 22:50:57,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:57,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916949239] [2025-04-13 22:50:57,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916949239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:50:57,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:50:57,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:50:57,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886853985] [2025-04-13 22:50:57,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:50:57,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 22:50:57,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:57,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 22:50:57,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 22:50:57,616 INFO L87 Difference]: Start difference. First operand 78233 states and 355333 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:51:43,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:51:43,101 INFO L93 Difference]: Finished difference Result 95895 states and 431392 transitions. [2025-04-13 22:51:43,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:51:43,102 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-13 22:51:43,102 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:51:43,581 INFO L225 Difference]: With dead ends: 95895 [2025-04-13 22:51:43,582 INFO L226 Difference]: Without dead ends: 95170 [2025-04-13 22:51:43,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:51:43,614 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 269 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:51:43,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 173 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:51:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95170 states. Received shutdown request... [2025-04-13 22:51:44,194 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 22:51:44,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 22:51:44,195 WARN L610 AbstractCegarLoop]: Verification canceled: while executing MinimizeSevpa. [2025-04-13 22:51:44,196 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 22:51:44,197 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 22:51:44,197 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 22:51:44,197 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 22:51:44,198 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:51:44,204 INFO L422 BasicCegarLoop]: Path program histogram: [8, 4, 2, 1, 1, 1, 1, 1] [2025-04-13 22:51:44,212 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:51:44,212 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:51:44,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:51:44 BasicIcfg [2025-04-13 22:51:44,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:51:44,219 INFO L158 Benchmark]: Toolchain (without parser) took 672557.23ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 109.5MB in the beginning and 816.1MB in the end (delta: -706.6MB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-13 22:51:44,219 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:51:44,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.66ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 93.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:51:44,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.12ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:51:44,219 INFO L158 Benchmark]: Boogie Preprocessor took 51.69ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 87.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:51:44,220 INFO L158 Benchmark]: IcfgBuilder took 806.83ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 47.4MB in the end (delta: 40.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2025-04-13 22:51:44,220 INFO L158 Benchmark]: TraceAbstraction took 671353.52ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 46.6MB in the beginning and 816.1MB in the end (delta: -769.5MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 22:51:44,221 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.20ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.66ms. Allocated memory is still 155.2MB. Free memory was 109.5MB in the beginning and 93.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.12ms. Allocated memory is still 155.2MB. Free memory was 93.5MB in the beginning and 90.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 51.69ms. Allocated memory is still 155.2MB. Free memory was 90.8MB in the beginning and 87.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 806.83ms. Allocated memory is still 155.2MB. Free memory was 87.7MB in the beginning and 47.4MB in the end (delta: 40.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 671353.52ms. Allocated memory was 155.2MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 46.6MB in the beginning and 816.1MB in the end (delta: -769.5MB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 70 locations, 79 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 671.2s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 8, EmptinessCheckTime: 2.0s, AutomataDifference: 430.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5780 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5780 mSDsluCounter, 3828 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3373 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14085 IncrementalHoareTripleChecker+Invalid, 14392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 455 mSDtfsCounter, 14085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 305 SyntacticMatches, 3 SemanticMatches, 366 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4047 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78233occurred in iteration=18, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 224.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 258691 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 931 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1064 ConstructedInterpolants, 6 QuantifiedInterpolants, 19131 SizeOfPredicates, 103 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 46/103 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown