/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/chl-poker-hand-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:19:13,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:19:13,801 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:19:13,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:19:13,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:19:13,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:19:13,828 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:19:13,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:19:13,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:19:13,828 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:19:13,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:19:13,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:19:13,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:19:13,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:19:13,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:19:13,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:19:13,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:19:13,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:19:13,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:19:13,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:19:13,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:19:13,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:19:13,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:19:13,832 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:19:14,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:19:14,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:19:14,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:19:14,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:19:14,055 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:19:14,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-13 22:19:15,349 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed89d225/730af2f7ad7646c0ad2372e0faced826/FLAGdd7ac197a [2025-04-13 22:19:15,581 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:19:15,581 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-poker-hand-subst.wvr.c [2025-04-13 22:19:15,589 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed89d225/730af2f7ad7646c0ad2372e0faced826/FLAGdd7ac197a [2025-04-13 22:19:16,350 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bed89d225/730af2f7ad7646c0ad2372e0faced826 [2025-04-13 22:19:16,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:19:16,352 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:19:16,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:19:16,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:19:16,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:19:16,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411490c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16, skipping insertion in model container [2025-04-13 22:19:16,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:19:16,682 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/chl-poker-hand-subst.wvr.c[19288,19301] [2025-04-13 22:19:16,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:19:16,695 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:19:16,789 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/chl-poker-hand-subst.wvr.c[19288,19301] [2025-04-13 22:19:16,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:19:16,817 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:19:16,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16 WrapperNode [2025-04-13 22:19:16,818 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:19:16,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:19:16,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:19:16,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:19:16,825 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:19:16" (1/1) ... [2025-04-13 22:19:16,842 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:19:16" (1/1) ... [2025-04-13 22:19:16,921 INFO L138 Inliner]: procedures = 25, calls = 439, calls flagged for inlining = 100, calls inlined = 144, statements flattened = 2348 [2025-04-13 22:19:16,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:19:16,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:19:16,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:19:16,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:19:16,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,988 INFO L175 MemorySlicer]: Split 278 memory accesses to 2 slices as follows [2, 276]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2025-04-13 22:19:16,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:16,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:19:17,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:19:17,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:19:17,064 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:19:17,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (1/1) ... [2025-04-13 22:19:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:19:17,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:17,087 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:19:17,089 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:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:19:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:19:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:19:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:19:17,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:19:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:19:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:19:17,106 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:19:17,264 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:19:17,265 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:19:18,991 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:19:18,992 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:19:18,992 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:19:21,319 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:19:21,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:19:21 BoogieIcfgContainer [2025-04-13 22:19:21,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:19:21,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:19:21,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:19:21,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:19:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:19:16" (1/3) ... [2025-04-13 22:19:21,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f492e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:19:21, skipping insertion in model container [2025-04-13 22:19:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:19:16" (2/3) ... [2025-04-13 22:19:21,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f492e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:19:21, skipping insertion in model container [2025-04-13 22:19:21,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:19:21" (3/3) ... [2025-04-13 22:19:21,326 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-subst.wvr.c [2025-04-13 22:19:21,337 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:19:21,338 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-poker-hand-subst.wvr.c that has 4 procedures, 73 locations, 105 edges, 1 initial locations, 18 loop locations, and 1 error locations. [2025-04-13 22:19:21,339 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:19:21,692 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:19:21,717 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 108 transitions, 237 flow [2025-04-13 22:19:22,134 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9024 states, 9023 states have (on average 4.71517233736008) internal successors, (42545), 9023 states have internal predecessors, (42545), 0 states have call successors, (0), 0 states have 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:19:22,150 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:19:22,158 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;@1367c929, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:19:22,158 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:19:22,198 INFO L278 IsEmpty]: Start isEmpty. Operand has 9024 states, 9023 states have (on average 4.71517233736008) internal successors, (42545), 9023 states have internal predecessors, (42545), 0 states have call successors, (0), 0 states have 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:19:22,263 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:19:22,263 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:22,264 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:19:22,264 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:22,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1359419738, now seen corresponding path program 1 times [2025-04-13 22:19:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:22,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537402067] [2025-04-13 22:19:22,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:22,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:19:22,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:19:22,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:22,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:22,804 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:19:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:22,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537402067] [2025-04-13 22:19:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537402067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:22,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:19:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961464980] [2025-04-13 22:19:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:22,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:19:22,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:22,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:19:22,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:19:22,851 INFO L87 Difference]: Start difference. First operand has 9024 states, 9023 states have (on average 4.71517233736008) internal successors, (42545), 9023 states have internal predecessors, (42545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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:19:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:23,430 INFO L93 Difference]: Finished difference Result 18046 states and 85087 transitions. [2025-04-13 22:19:23,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:19:23,431 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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:19:23,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:23,531 INFO L225 Difference]: With dead ends: 18046 [2025-04-13 22:19:23,531 INFO L226 Difference]: Without dead ends: 9027 [2025-04-13 22:19:23,555 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:19:23,558 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:23,558 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9027 states. [2025-04-13 22:19:23,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9027 to 9027. [2025-04-13 22:19:23,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9027 states, 9026 states have (on average 4.713937513848881) internal successors, (42548), 9026 states have internal predecessors, (42548), 0 states have call successors, (0), 0 states have 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:19:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 42548 transitions. [2025-04-13 22:19:23,957 INFO L79 Accepts]: Start accepts. Automaton has 9027 states and 42548 transitions. Word has length 32 [2025-04-13 22:19:23,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:23,957 INFO L485 AbstractCegarLoop]: Abstraction has 9027 states and 42548 transitions. [2025-04-13 22:19:23,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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:19:23,958 INFO L278 IsEmpty]: Start isEmpty. Operand 9027 states and 42548 transitions. [2025-04-13 22:19:23,986 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 22:19:23,986 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:23,987 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:19:23,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:19:23,987 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:23,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:23,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1808174788, now seen corresponding path program 1 times [2025-04-13 22:19:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:23,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766863327] [2025-04-13 22:19:23,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:23,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:24,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 22:19:24,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 22:19:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:24,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:24,259 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:19:24,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:24,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766863327] [2025-04-13 22:19:24,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766863327] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:24,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:24,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:19:24,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839638401] [2025-04-13 22:19:24,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:24,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:19:24,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:24,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:19:24,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:19:24,264 INFO L87 Difference]: Start difference. First operand 9027 states and 42548 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:19:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:24,769 INFO L93 Difference]: Finished difference Result 18049 states and 85090 transitions. [2025-04-13 22:19:24,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:19:24,769 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:19:24,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:24,849 INFO L225 Difference]: With dead ends: 18049 [2025-04-13 22:19:24,850 INFO L226 Difference]: Without dead ends: 9033 [2025-04-13 22:19:24,870 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:19:24,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:24,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9033 states. [2025-04-13 22:19:25,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9033 to 9033. [2025-04-13 22:19:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9033 states, 9032 states have (on average 4.711470327723649) internal successors, (42554), 9032 states have internal predecessors, (42554), 0 states have call successors, (0), 0 states have 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:19:25,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9033 states to 9033 states and 42554 transitions. [2025-04-13 22:19:25,252 INFO L79 Accepts]: Start accepts. Automaton has 9033 states and 42554 transitions. Word has length 35 [2025-04-13 22:19:25,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:25,253 INFO L485 AbstractCegarLoop]: Abstraction has 9033 states and 42554 transitions. [2025-04-13 22:19:25,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have 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:19:25,253 INFO L278 IsEmpty]: Start isEmpty. Operand 9033 states and 42554 transitions. [2025-04-13 22:19:25,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 22:19:25,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:25,276 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:19:25,276 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:19:25,276 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:25,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1481436654, now seen corresponding path program 1 times [2025-04-13 22:19:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:25,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426309753] [2025-04-13 22:19:25,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:25,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:19:25,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:19:25,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:25,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 22:19:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:25,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426309753] [2025-04-13 22:19:25,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426309753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:25,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955156997] [2025-04-13 22:19:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:25,534 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:19:25,535 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:19:26,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 22:19:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 22:19:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:26,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 665 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 22:19:26,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-04-13 22:19:26,197 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 22:19:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955156997] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:19:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-04-13 22:19:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284163795] [2025-04-13 22:19:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:26,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:19:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:26,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:19:26,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:19:26,198 INFO L87 Difference]: Start difference. First operand 9033 states and 42554 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 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:19:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:26,609 INFO L93 Difference]: Finished difference Result 18067 states and 85111 transitions. [2025-04-13 22:19:26,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:19:26,610 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 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:19:26,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:26,678 INFO L225 Difference]: With dead ends: 18067 [2025-04-13 22:19:26,679 INFO L226 Difference]: Without dead ends: 9036 [2025-04-13 22:19:26,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:19:26,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:26,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:26,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9036 states. [2025-04-13 22:19:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9036 to 9036. [2025-04-13 22:19:27,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9036 states, 9035 states have (on average 4.7102379634753735) internal successors, (42557), 9035 states have internal predecessors, (42557), 0 states have call successors, (0), 0 states have 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:19:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9036 states to 9036 states and 42557 transitions. [2025-04-13 22:19:27,224 INFO L79 Accepts]: Start accepts. Automaton has 9036 states and 42557 transitions. Word has length 41 [2025-04-13 22:19:27,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:27,224 INFO L485 AbstractCegarLoop]: Abstraction has 9036 states and 42557 transitions. [2025-04-13 22:19:27,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 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:19:27,225 INFO L278 IsEmpty]: Start isEmpty. Operand 9036 states and 42557 transitions. [2025-04-13 22:19:27,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:19:27,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:27,252 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, 1, 1] [2025-04-13 22:19:27,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:19:27,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:27,453 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:27,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash 31026319, now seen corresponding path program 1 times [2025-04-13 22:19:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:27,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750309724] [2025-04-13 22:19:27,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:27,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:19:27,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:19:27,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:27,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:19:27,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:27,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750309724] [2025-04-13 22:19:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750309724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:27,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390466615] [2025-04-13 22:19:27,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:27,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:27,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:27,725 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:19:27,726 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:19:28,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:19:28,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:19:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:28,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:19:28,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:19:28,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-04-13 22:19:28,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390466615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:28,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:28,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-04-13 22:19:28,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857241546] [2025-04-13 22:19:28,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:28,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:19:28,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:28,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:19:28,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:19:28,316 INFO L87 Difference]: Start difference. First operand 9036 states and 42557 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:28,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:28,805 INFO L93 Difference]: Finished difference Result 18093 states and 85158 transitions. [2025-04-13 22:19:28,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 22:19:28,805 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:19:28,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:28,865 INFO L225 Difference]: With dead ends: 18093 [2025-04-13 22:19:28,865 INFO L226 Difference]: Without dead ends: 9060 [2025-04-13 22:19:28,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:19:28,885 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:28,885 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2025-04-13 22:19:29,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 9060. [2025-04-13 22:19:29,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9060 states, 9059 states have (on average 4.700408433601943) internal successors, (42581), 9059 states have internal predecessors, (42581), 0 states have call successors, (0), 0 states have 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:19:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9060 states to 9060 states and 42581 transitions. [2025-04-13 22:19:29,129 INFO L79 Accepts]: Start accepts. Automaton has 9060 states and 42581 transitions. Word has length 44 [2025-04-13 22:19:29,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:29,129 INFO L485 AbstractCegarLoop]: Abstraction has 9060 states and 42581 transitions. [2025-04-13 22:19:29,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:29,129 INFO L278 IsEmpty]: Start isEmpty. Operand 9060 states and 42581 transitions. [2025-04-13 22:19:29,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:19:29,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:29,150 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2025-04-13 22:19:29,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:29,351 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 22:19:29,351 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:29,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:29,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1608605542, now seen corresponding path program 2 times [2025-04-13 22:19:29,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:29,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95009297] [2025-04-13 22:19:29,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:29,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-04-13 22:19:29,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 68 statements. [2025-04-13 22:19:29,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:19:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-13 22:19:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:31,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95009297] [2025-04-13 22:19:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95009297] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:31,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:19:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195376224] [2025-04-13 22:19:31,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:31,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:19:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:31,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:19:31,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:19:31,144 INFO L87 Difference]: Start difference. First operand 9060 states and 42581 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:31,853 INFO L93 Difference]: Finished difference Result 12382 states and 55179 transitions. [2025-04-13 22:19:31,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:19:31,854 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-04-13 22:19:31,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:31,913 INFO L225 Difference]: With dead ends: 12382 [2025-04-13 22:19:31,913 INFO L226 Difference]: Without dead ends: 10254 [2025-04-13 22:19:31,920 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:19:31,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:31,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10254 states. [2025-04-13 22:19:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10254 to 9108. [2025-04-13 22:19:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9108 states, 9107 states have (on average 4.683540133962886) internal successors, (42653), 9107 states have internal predecessors, (42653), 0 states have call successors, (0), 0 states have 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:19:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9108 states to 9108 states and 42653 transitions. [2025-04-13 22:19:32,224 INFO L79 Accepts]: Start accepts. Automaton has 9108 states and 42653 transitions. Word has length 68 [2025-04-13 22:19:32,225 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:32,225 INFO L485 AbstractCegarLoop]: Abstraction has 9108 states and 42653 transitions. [2025-04-13 22:19:32,225 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:32,225 INFO L278 IsEmpty]: Start isEmpty. Operand 9108 states and 42653 transitions. [2025-04-13 22:19:32,244 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:19:32,244 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:32,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2025-04-13 22:19:32,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:19:32,245 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:32,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:32,245 INFO L85 PathProgramCache]: Analyzing trace with hash -201785142, now seen corresponding path program 3 times [2025-04-13 22:19:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:32,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146490968] [2025-04-13 22:19:32,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:32,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 68 statements into 3 equivalence classes. [2025-04-13 22:19:32,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 68 statements. [2025-04-13 22:19:32,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:19:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-04-13 22:19:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:32,968 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146490968] [2025-04-13 22:19:32,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146490968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:32,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:32,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:19:32,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546093062] [2025-04-13 22:19:32,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:32,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:19:32,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:32,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:19:32,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:19:32,969 INFO L87 Difference]: Start difference. First operand 9108 states and 42653 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:33,812 INFO L93 Difference]: Finished difference Result 11147 states and 50118 transitions. [2025-04-13 22:19:33,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:19:33,813 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-04-13 22:19:33,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:33,883 INFO L225 Difference]: With dead ends: 11147 [2025-04-13 22:19:33,883 INFO L226 Difference]: Without dead ends: 10983 [2025-04-13 22:19:33,888 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:19:33,890 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:33,890 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:19:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10983 states. [2025-04-13 22:19:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10983 to 9233. [2025-04-13 22:19:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9233 states, 9232 states have (on average 4.684683708838821) internal successors, (43249), 9232 states have internal predecessors, (43249), 0 states have call successors, (0), 0 states have 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:19:34,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9233 states to 9233 states and 43249 transitions. [2025-04-13 22:19:34,318 INFO L79 Accepts]: Start accepts. Automaton has 9233 states and 43249 transitions. Word has length 68 [2025-04-13 22:19:34,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:34,319 INFO L485 AbstractCegarLoop]: Abstraction has 9233 states and 43249 transitions. [2025-04-13 22:19:34,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:34,319 INFO L278 IsEmpty]: Start isEmpty. Operand 9233 states and 43249 transitions. [2025-04-13 22:19:34,342 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-04-13 22:19:34,342 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:34,342 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2025-04-13 22:19:34,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:19:34,343 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:34,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 2094523676, now seen corresponding path program 1 times [2025-04-13 22:19:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:34,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978574161] [2025-04-13 22:19:34,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:34,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:19:34,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:19:34,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 22:19:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:34,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978574161] [2025-04-13 22:19:34,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978574161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:34,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425277954] [2025-04-13 22:19:34,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:19:34,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:34,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:34,604 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:19:34,606 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:19:35,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-13 22:19:35,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-13 22:19:35,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:35,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:19:35,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 22:19:35,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-04-13 22:19:35,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425277954] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:35,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:35,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 22:19:35,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345264828] [2025-04-13 22:19:35,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:35,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 22:19:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:35,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 22:19:35,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:19:35,295 INFO L87 Difference]: Start difference. First operand 9233 states and 43249 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:35,863 INFO L93 Difference]: Finished difference Result 18478 states and 86527 transitions. [2025-04-13 22:19:35,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:19:35,865 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-04-13 22:19:35,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:35,934 INFO L225 Difference]: With dead ends: 18478 [2025-04-13 22:19:35,934 INFO L226 Difference]: Without dead ends: 9251 [2025-04-13 22:19:35,952 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:19:35,953 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:35,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9251 states. [2025-04-13 22:19:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9251 to 9251. [2025-04-13 22:19:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9251 states, 9250 states have (on average 4.677513513513514) internal successors, (43267), 9250 states have internal predecessors, (43267), 0 states have call successors, (0), 0 states have 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:19:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9251 states to 9251 states and 43267 transitions. [2025-04-13 22:19:36,256 INFO L79 Accepts]: Start accepts. Automaton has 9251 states and 43267 transitions. Word has length 68 [2025-04-13 22:19:36,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:36,256 INFO L485 AbstractCegarLoop]: Abstraction has 9251 states and 43267 transitions. [2025-04-13 22:19:36,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:36,256 INFO L278 IsEmpty]: Start isEmpty. Operand 9251 states and 43267 transitions. [2025-04-13 22:19:36,274 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-13 22:19:36,274 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:36,274 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:36,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 22:19:36,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:36,475 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:36,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:36,475 INFO L85 PathProgramCache]: Analyzing trace with hash -423314233, now seen corresponding path program 2 times [2025-04-13 22:19:36,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:36,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682885038] [2025-04-13 22:19:36,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:36,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:36,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-04-13 22:19:36,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 86 statements. [2025-04-13 22:19:36,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:19:36,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-04-13 22:19:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:36,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682885038] [2025-04-13 22:19:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682885038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:19:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756507424] [2025-04-13 22:19:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:36,954 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:19:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:36,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:19:36,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:19:36,954 INFO L87 Difference]: Start difference. First operand 9251 states and 43267 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:37,649 INFO L93 Difference]: Finished difference Result 14935 states and 64829 transitions. [2025-04-13 22:19:37,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:19:37,649 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-04-13 22:19:37,650 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:37,714 INFO L225 Difference]: With dead ends: 14935 [2025-04-13 22:19:37,714 INFO L226 Difference]: Without dead ends: 10667 [2025-04-13 22:19:37,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:19:37,724 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:37,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10667 states. [2025-04-13 22:19:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10667 to 8473. [2025-04-13 22:19:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8473 states, 8472 states have (on average 4.528682719546742) internal successors, (38367), 8472 states have internal predecessors, (38367), 0 states have call successors, (0), 0 states have 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:19:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8473 states to 8473 states and 38367 transitions. [2025-04-13 22:19:38,031 INFO L79 Accepts]: Start accepts. Automaton has 8473 states and 38367 transitions. Word has length 86 [2025-04-13 22:19:38,031 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:38,031 INFO L485 AbstractCegarLoop]: Abstraction has 8473 states and 38367 transitions. [2025-04-13 22:19:38,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:38,031 INFO L278 IsEmpty]: Start isEmpty. Operand 8473 states and 38367 transitions. [2025-04-13 22:19:38,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-13 22:19:38,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:38,049 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:38,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:19:38,049 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:38,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:38,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1259780935, now seen corresponding path program 3 times [2025-04-13 22:19:38,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:38,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333695385] [2025-04-13 22:19:38,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:38,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:38,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 86 statements into 4 equivalence classes. [2025-04-13 22:19:38,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 32 of 86 statements. [2025-04-13 22:19:38,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:19:38,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:38,476 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-04-13 22:19:38,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:38,476 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333695385] [2025-04-13 22:19:38,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333695385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:19:38,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:19:38,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:19:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842873382] [2025-04-13 22:19:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:19:38,477 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:19:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:38,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:19:38,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:19:38,478 INFO L87 Difference]: Start difference. First operand 8473 states and 38367 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:39,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:39,141 INFO L93 Difference]: Finished difference Result 11712 states and 49704 transitions. [2025-04-13 22:19:39,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:19:39,141 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-04-13 22:19:39,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:39,191 INFO L225 Difference]: With dead ends: 11712 [2025-04-13 22:19:39,191 INFO L226 Difference]: Without dead ends: 10263 [2025-04-13 22:19:39,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:19:39,197 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:39,198 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10263 states. [2025-04-13 22:19:39,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10263 to 8108. [2025-04-13 22:19:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8108 states, 8107 states have (on average 4.534476378438387) internal successors, (36761), 8107 states have internal predecessors, (36761), 0 states have call successors, (0), 0 states have 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:19:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8108 states to 8108 states and 36761 transitions. [2025-04-13 22:19:39,482 INFO L79 Accepts]: Start accepts. Automaton has 8108 states and 36761 transitions. Word has length 86 [2025-04-13 22:19:39,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:39,482 INFO L485 AbstractCegarLoop]: Abstraction has 8108 states and 36761 transitions. [2025-04-13 22:19:39,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:19:39,482 INFO L278 IsEmpty]: Start isEmpty. Operand 8108 states and 36761 transitions. [2025-04-13 22:19:39,496 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-04-13 22:19:39,496 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:39,496 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:39,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:19:39,497 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:39,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1593842373, now seen corresponding path program 4 times [2025-04-13 22:19:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:39,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479615355] [2025-04-13 22:19:39,497 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:39,529 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-04-13 22:19:39,547 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-13 22:19:39,547 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:39,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:39,751 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-04-13 22:19:39,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:39,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479615355] [2025-04-13 22:19:39,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479615355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:39,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724233192] [2025-04-13 22:19:39,752 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:39,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:39,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:39,754 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:19:39,756 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:19:40,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 86 statements into 2 equivalence classes. [2025-04-13 22:19:40,471 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-04-13 22:19:40,472 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:40,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:40,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 22:19:40,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-04-13 22:19:40,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-04-13 22:19:40,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724233192] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:40,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:40,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2025-04-13 22:19:40,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846729296] [2025-04-13 22:19:40,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:40,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:19:40,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:40,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:19:40,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:19:40,822 INFO L87 Difference]: Start difference. First operand 8108 states and 36761 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:19:41,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:41,403 INFO L93 Difference]: Finished difference Result 16212 states and 73535 transitions. [2025-04-13 22:19:41,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:19:41,403 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 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 86 [2025-04-13 22:19:41,403 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:41,460 INFO L225 Difference]: With dead ends: 16212 [2025-04-13 22:19:41,460 INFO L226 Difference]: Without dead ends: 8129 [2025-04-13 22:19:41,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:19:41,476 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:41,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2025-04-13 22:19:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 8129. [2025-04-13 22:19:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8129 states, 8128 states have (on average 4.525344488188976) internal successors, (36782), 8128 states have internal predecessors, (36782), 0 states have call successors, (0), 0 states have 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:19:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8129 states to 8129 states and 36782 transitions. [2025-04-13 22:19:41,807 INFO L79 Accepts]: Start accepts. Automaton has 8129 states and 36782 transitions. Word has length 86 [2025-04-13 22:19:41,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:41,807 INFO L485 AbstractCegarLoop]: Abstraction has 8129 states and 36782 transitions. [2025-04-13 22:19:41,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have 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:19:41,807 INFO L278 IsEmpty]: Start isEmpty. Operand 8129 states and 36782 transitions. [2025-04-13 22:19:41,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-04-13 22:19:41,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:41,834 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:41,857 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:19:42,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:42,035 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:19:42,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash -17284115, now seen corresponding path program 5 times [2025-04-13 22:19:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:42,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795115354] [2025-04-13 22:19:42,035 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:42,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 7 equivalence classes. [2025-04-13 22:19:42,208 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 107 of 107 statements. [2025-04-13 22:19:42,209 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-04-13 22:19:42,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:42,575 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-04-13 22:19:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:42,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795115354] [2025-04-13 22:19:42,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795115354] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:42,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920836349] [2025-04-13 22:19:42,575 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:42,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:42,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:42,578 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:19:42,579 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:19:43,129 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 107 statements into 7 equivalence classes. Received shutdown request... [2025-04-13 22:33:45,171 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:33:45,174 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:33:46,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2025-04-13 22:33:46,379 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2025-04-13 22:33:46,438 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-13 22:33:46,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-04-13 22:33:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-04-13 22:33:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543515161] [2025-04-13 22:33:46,438 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-04-13 22:33:46,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:33:46,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:33:46,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:33:46,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:33:46,439 INFO L87 Difference]: Start difference. First operand 8129 states and 36782 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:33:46,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2025-04-13 22:33:46,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 22:33:46,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:33:46,446 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:33:46,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:33:46,447 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 22:33:46,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 22:33:46,448 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (8129states) and FLOYD_HOARE automaton (currently 2 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). [2025-04-13 22:33:46,449 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 22:33:46,449 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 22:33:46,449 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 22:33:46,451 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2025-04-13 22:33:46,454 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:33:46,454 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:33:46,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:33:46 BasicIcfg [2025-04-13 22:33:46,456 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:33:46,457 INFO L158 Benchmark]: Toolchain (without parser) took 870104.17ms. Allocated memory was 155.2MB in the beginning and 939.5MB in the end (delta: 784.3MB). Free memory was 108.5MB in the beginning and 657.8MB in the end (delta: -549.3MB). Peak memory consumption was 236.9MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,457 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:33:46,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.61ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 80.1MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,457 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.86ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 68.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,458 INFO L158 Benchmark]: Boogie Preprocessor took 140.63ms. Allocated memory is still 155.2MB. Free memory was 68.4MB in the beginning and 55.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,458 INFO L158 Benchmark]: IcfgBuilder took 4256.24ms. Allocated memory was 155.2MB in the beginning and 696.3MB in the end (delta: 541.1MB). Free memory was 55.8MB in the beginning and 557.8MB in the end (delta: -502.0MB). Peak memory consumption was 215.2MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,458 INFO L158 Benchmark]: TraceAbstraction took 865134.79ms. Allocated memory was 696.3MB in the beginning and 939.5MB in the end (delta: 243.3MB). Free memory was 557.8MB in the beginning and 657.8MB in the end (delta: -100.0MB). Peak memory consumption was 144.7MB. Max. memory is 8.0GB. [2025-04-13 22:33:46,459 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 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.61ms. Allocated memory is still 155.2MB. Free memory was 108.5MB in the beginning and 80.1MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.86ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 68.4MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 140.63ms. Allocated memory is still 155.2MB. Free memory was 68.4MB in the beginning and 55.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgBuilder took 4256.24ms. Allocated memory was 155.2MB in the beginning and 696.3MB in the end (delta: 541.1MB). Free memory was 55.8MB in the beginning and 557.8MB in the end (delta: -502.0MB). Peak memory consumption was 215.2MB. Max. memory is 8.0GB. * TraceAbstraction took 865134.79ms. Allocated memory was 696.3MB in the beginning and 939.5MB in the end (delta: 243.3MB). Free memory was 557.8MB in the beginning and 657.8MB in the end (delta: -100.0MB). Peak memory consumption was 144.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 344]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (8129states) and FLOYD_HOARE automaton (currently 2 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 338]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (8129states) and FLOYD_HOARE automaton (currently 2 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 337]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (8129states) and FLOYD_HOARE automaton (currently 2 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 336]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (8129states) and FLOYD_HOARE automaton (currently 2 states, 15 states before enhancement),while ReachableStatesComputation was computing reachable states (1 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 124 locations, 183 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 864.7s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.3s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4301 IncrementalHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 0 mSDtfsCounter, 4301 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 426 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9251occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 7245 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 960 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1140 ConstructedInterpolants, 0 QuantifiedInterpolants, 2303 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3346 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 1379/1536 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