/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:20:14,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:20:14,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:20:14,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:20:14,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:20:14,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:20:14,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:20:14,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:20:14,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:20:14,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:20:14,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:20:14,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:20:14,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:20:14,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:20:14,700 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:20:14,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:20:14,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:20:14,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:14,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:14,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:20:14,702 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:20:14,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:20:14,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:20:14,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:20:14,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:20:14,945 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:20:14,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2025-04-13 18:20:16,240 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da53f6843/2578ae87534d4f6384c5026aefdb1a79/FLAG567931600 [2025-04-13 18:20:16,431 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:20:16,432 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2025-04-13 18:20:16,440 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da53f6843/2578ae87534d4f6384c5026aefdb1a79/FLAG567931600 [2025-04-13 18:20:17,241 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da53f6843/2578ae87534d4f6384c5026aefdb1a79 [2025-04-13 18:20:17,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:20:17,245 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:20:17,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:20:17,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:20:17,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:20:17,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c142658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17, skipping insertion in model container [2025-04-13 18:20:17,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:20:17,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[2683,2696] [2025-04-13 18:20:17,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:20:17,476 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:20:17,512 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[2683,2696] [2025-04-13 18:20:17,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:20:17,536 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:20:17,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17 WrapperNode [2025-04-13 18:20:17,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:20:17,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:20:17,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:20:17,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:20:17,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,566 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-04-13 18:20:17,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:20:17,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:20:17,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:20:17,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:20:17,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,598 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:20:17,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,604 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,616 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:20:17,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:20:17,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:20:17,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:20:17,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (1/1) ... [2025-04-13 18:20:17,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:20:17,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:20:17,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:20:17,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:20:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:20:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:20:17,669 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:20:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:20:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:20:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:20:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:20:17,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:20:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:20:17,671 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:20:17,754 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:20:17,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:20:18,001 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:20:18,003 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:20:18,003 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:20:18,149 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:18,151 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:18,153 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:20:18,156 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:20:18,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:20:18 BoogieIcfgContainer [2025-04-13 18:20:18,156 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:20:18,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:20:18,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:20:18,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:20:18,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:20:17" (1/3) ... [2025-04-13 18:20:18,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:20:18, skipping insertion in model container [2025-04-13 18:20:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:20:17" (2/3) ... [2025-04-13 18:20:18,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf0036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:20:18, skipping insertion in model container [2025-04-13 18:20:18,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:20:18" (3/3) ... [2025-04-13 18:20:18,163 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2025-04-13 18:20:18,174 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:20:18,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-min-max-dec.wvr.c that has 5 procedures, 51 locations, 55 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 18:20:18,175 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:20:18,226 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:20:18,247 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 63 places, 59 transitions, 146 flow [2025-04-13 18:20:18,605 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:18,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:20:18,639 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;@72b9db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:20:18,639 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:20:18,671 INFO L278 IsEmpty]: Start isEmpty. Operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:18,744 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:20:18,744 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:18,745 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] [2025-04-13 18:20:18,745 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:18,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1559566285, now seen corresponding path program 1 times [2025-04-13 18:20:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:18,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934847504] [2025-04-13 18:20:18,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:18,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:18,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:20:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:20:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:18,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:20:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:18,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934847504] [2025-04-13 18:20:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934847504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:18,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:18,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577347199] [2025-04-13 18:20:18,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:18,989 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:20:18,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:19,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:20:19,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:19,024 INFO L87 Difference]: Start difference. First operand has 7823 states, 7822 states have (on average 4.6498338020966505) internal successors, (36371), 7822 states have internal predecessors, (36371), 0 states have call successors, (0), 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 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:19,299 INFO L93 Difference]: Finished difference Result 10421 states and 45970 transitions. [2025-04-13 18:20:19,300 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:20:19,301 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-04-13 18:20:19,301 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:19,422 INFO L225 Difference]: With dead ends: 10421 [2025-04-13 18:20:19,423 INFO L226 Difference]: Without dead ends: 7823 [2025-04-13 18:20:19,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:19,436 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:19,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 12 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:20:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2025-04-13 18:20:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7823. [2025-04-13 18:20:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7823 states, 7822 states have (on average 4.311301457427768) internal successors, (33723), 7822 states have internal predecessors, (33723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 33723 transitions. [2025-04-13 18:20:19,933 INFO L79 Accepts]: Start accepts. Automaton has 7823 states and 33723 transitions. Word has length 33 [2025-04-13 18:20:19,934 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:19,935 INFO L485 AbstractCegarLoop]: Abstraction has 7823 states and 33723 transitions. [2025-04-13 18:20:19,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:19,936 INFO L278 IsEmpty]: Start isEmpty. Operand 7823 states and 33723 transitions. [2025-04-13 18:20:19,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:20:19,967 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:19,967 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] [2025-04-13 18:20:19,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:20:19,968 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:19,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:19,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2021361384, now seen corresponding path program 1 times [2025-04-13 18:20:19,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:19,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335646549] [2025-04-13 18:20:19,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:19,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:20:20,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:20:20,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:20,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:20:20,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:20,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335646549] [2025-04-13 18:20:20,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335646549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:20,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51565768] [2025-04-13 18:20:20,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:20,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:20:20,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:20,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:20:20,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:20,220 INFO L87 Difference]: Start difference. First operand 7823 states and 33723 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:20,563 INFO L93 Difference]: Finished difference Result 15643 states and 67443 transitions. [2025-04-13 18:20:20,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:20:20,563 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:20:20,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:20,626 INFO L225 Difference]: With dead ends: 15643 [2025-04-13 18:20:20,626 INFO L226 Difference]: Without dead ends: 7824 [2025-04-13 18:20:20,641 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:20:20,642 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:20,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:20:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2025-04-13 18:20:20,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7824. [2025-04-13 18:20:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7824 states, 7823 states have (on average 4.310878179726448) internal successors, (33724), 7823 states have internal predecessors, (33724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7824 states to 7824 states and 33724 transitions. [2025-04-13 18:20:20,977 INFO L79 Accepts]: Start accepts. Automaton has 7824 states and 33724 transitions. Word has length 43 [2025-04-13 18:20:20,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:20,978 INFO L485 AbstractCegarLoop]: Abstraction has 7824 states and 33724 transitions. [2025-04-13 18:20:20,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:20,978 INFO L278 IsEmpty]: Start isEmpty. Operand 7824 states and 33724 transitions. [2025-04-13 18:20:21,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:21,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:21,002 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 18:20:21,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:20:21,003 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:21,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1357589348, now seen corresponding path program 1 times [2025-04-13 18:20:21,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:21,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381108026] [2025-04-13 18:20:21,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:21,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:21,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:21,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381108026] [2025-04-13 18:20:21,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381108026] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:21,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:21,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191893194] [2025-04-13 18:20:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:21,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:21,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:21,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:21,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:21,367 INFO L87 Difference]: Start difference. First operand 7824 states and 33724 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:23,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:23,805 INFO L93 Difference]: Finished difference Result 37414 states and 161658 transitions. [2025-04-13 18:20:23,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:20:23,805 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:23,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:23,980 INFO L225 Difference]: With dead ends: 37414 [2025-04-13 18:20:23,981 INFO L226 Difference]: Without dead ends: 24176 [2025-04-13 18:20:24,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=510, Invalid=2040, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 18:20:24,021 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 473 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:24,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 329 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:20:24,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24176 states. [2025-04-13 18:20:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24176 to 10876. [2025-04-13 18:20:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10876 states, 10875 states have (on average 4.257287356321839) internal successors, (46298), 10875 states have internal predecessors, (46298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10876 states to 10876 states and 46298 transitions. [2025-04-13 18:20:24,639 INFO L79 Accepts]: Start accepts. Automaton has 10876 states and 46298 transitions. Word has length 44 [2025-04-13 18:20:24,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:24,640 INFO L485 AbstractCegarLoop]: Abstraction has 10876 states and 46298 transitions. [2025-04-13 18:20:24,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:24,640 INFO L278 IsEmpty]: Start isEmpty. Operand 10876 states and 46298 transitions. [2025-04-13 18:20:24,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:24,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:24,784 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 18:20:24,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:20:24,784 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:24,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1736209896, now seen corresponding path program 2 times [2025-04-13 18:20:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:24,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092627477] [2025-04-13 18:20:24,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:24,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:24,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:24,809 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:24,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:24,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:25,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:25,039 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092627477] [2025-04-13 18:20:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092627477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:25,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:25,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:25,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495812089] [2025-04-13 18:20:25,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:25,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:20:25,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:25,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:20:25,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:20:25,040 INFO L87 Difference]: Start difference. First operand 10876 states and 46298 transitions. Second operand has 5 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 18:20:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:25,387 INFO L93 Difference]: Finished difference Result 16788 states and 71366 transitions. [2025-04-13 18:20:25,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:20:25,387 INFO L79 Accepts]: Start accepts. Automaton has has 5 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 44 [2025-04-13 18:20:25,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:25,535 INFO L225 Difference]: With dead ends: 16788 [2025-04-13 18:20:25,536 INFO L226 Difference]: Without dead ends: 11704 [2025-04-13 18:20:25,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:20:25,551 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 139 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:25,555 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 89 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:20:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11704 states. [2025-04-13 18:20:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11704 to 10264. [2025-04-13 18:20:25,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10264 states, 10263 states have (on average 4.239306245737114) internal successors, (43508), 10263 states have internal predecessors, (43508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10264 states to 10264 states and 43508 transitions. [2025-04-13 18:20:25,863 INFO L79 Accepts]: Start accepts. Automaton has 10264 states and 43508 transitions. Word has length 44 [2025-04-13 18:20:25,864 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:25,864 INFO L485 AbstractCegarLoop]: Abstraction has 10264 states and 43508 transitions. [2025-04-13 18:20:25,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 18:20:25,865 INFO L278 IsEmpty]: Start isEmpty. Operand 10264 states and 43508 transitions. [2025-04-13 18:20:25,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:25,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:25,888 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 18:20:25,889 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:20:25,889 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:25,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1993913634, now seen corresponding path program 3 times [2025-04-13 18:20:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:25,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873560809] [2025-04-13 18:20:25,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:25,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:25,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:25,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:25,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:26,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:26,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:26,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873560809] [2025-04-13 18:20:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873560809] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541665052] [2025-04-13 18:20:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:26,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:26,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:26,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:26,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:26,150 INFO L87 Difference]: Start difference. First operand 10264 states and 43508 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:27,260 INFO L93 Difference]: Finished difference Result 25429 states and 108423 transitions. [2025-04-13 18:20:27,260 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:20:27,261 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:27,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:27,359 INFO L225 Difference]: With dead ends: 25429 [2025-04-13 18:20:27,359 INFO L226 Difference]: Without dead ends: 19767 [2025-04-13 18:20:27,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:20:27,378 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 459 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:27,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 208 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:20:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19767 states. [2025-04-13 18:20:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19767 to 10360. [2025-04-13 18:20:27,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10360 states, 10359 states have (on average 4.233613283135438) internal successors, (43856), 10359 states have internal predecessors, (43856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:27,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10360 states to 10360 states and 43856 transitions. [2025-04-13 18:20:27,869 INFO L79 Accepts]: Start accepts. Automaton has 10360 states and 43856 transitions. Word has length 44 [2025-04-13 18:20:27,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:27,870 INFO L485 AbstractCegarLoop]: Abstraction has 10360 states and 43856 transitions. [2025-04-13 18:20:27,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:27,870 INFO L278 IsEmpty]: Start isEmpty. Operand 10360 states and 43856 transitions. [2025-04-13 18:20:27,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:27,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:27,900 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 18:20:27,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:20:27,900 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:27,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:27,900 INFO L85 PathProgramCache]: Analyzing trace with hash -377215682, now seen corresponding path program 4 times [2025-04-13 18:20:27,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:27,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562705893] [2025-04-13 18:20:27,900 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:27,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:27,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:27,917 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:20:27,917 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:20:27,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:27,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:27,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562705893] [2025-04-13 18:20:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562705893] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:27,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:20:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303039183] [2025-04-13 18:20:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:27,984 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:20:27,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:27,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:20:27,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:20:27,985 INFO L87 Difference]: Start difference. First operand 10360 states and 43856 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:28,461 INFO L93 Difference]: Finished difference Result 22251 states and 96262 transitions. [2025-04-13 18:20:28,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:20:28,462 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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 44 [2025-04-13 18:20:28,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:28,570 INFO L225 Difference]: With dead ends: 22251 [2025-04-13 18:20:28,571 INFO L226 Difference]: Without dead ends: 16953 [2025-04-13 18:20:28,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:28,587 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 147 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:28,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 121 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:20:28,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2025-04-13 18:20:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 15179. [2025-04-13 18:20:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15179 states, 15178 states have (on average 4.219594149426802) internal successors, (64045), 15178 states have internal predecessors, (64045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15179 states to 15179 states and 64045 transitions. [2025-04-13 18:20:29,115 INFO L79 Accepts]: Start accepts. Automaton has 15179 states and 64045 transitions. Word has length 44 [2025-04-13 18:20:29,116 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:29,116 INFO L485 AbstractCegarLoop]: Abstraction has 15179 states and 64045 transitions. [2025-04-13 18:20:29,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:29,116 INFO L278 IsEmpty]: Start isEmpty. Operand 15179 states and 64045 transitions. [2025-04-13 18:20:29,157 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:29,158 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:29,158 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 18:20:29,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:20:29,158 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:29,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:29,158 INFO L85 PathProgramCache]: Analyzing trace with hash -448759134, now seen corresponding path program 5 times [2025-04-13 18:20:29,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:29,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344775379] [2025-04-13 18:20:29,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:29,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:29,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:29,182 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:29,182 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:20:29,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:29,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:29,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344775379] [2025-04-13 18:20:29,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344775379] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:29,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:29,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:29,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201863922] [2025-04-13 18:20:29,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:29,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:29,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:29,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:29,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:29,364 INFO L87 Difference]: Start difference. First operand 15179 states and 64045 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:30,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:30,560 INFO L93 Difference]: Finished difference Result 41378 states and 174613 transitions. [2025-04-13 18:20:30,560 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:20:30,560 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:30,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:30,723 INFO L225 Difference]: With dead ends: 41378 [2025-04-13 18:20:30,724 INFO L226 Difference]: Without dead ends: 35730 [2025-04-13 18:20:30,741 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=586, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:20:30,742 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 455 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:30,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 227 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:20:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35730 states. [2025-04-13 18:20:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35730 to 15371. [2025-04-13 18:20:31,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15371 states, 15370 states have (on average 4.212166558230319) internal successors, (64741), 15370 states have internal predecessors, (64741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15371 states to 15371 states and 64741 transitions. [2025-04-13 18:20:31,435 INFO L79 Accepts]: Start accepts. Automaton has 15371 states and 64741 transitions. Word has length 44 [2025-04-13 18:20:31,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:31,435 INFO L485 AbstractCegarLoop]: Abstraction has 15371 states and 64741 transitions. [2025-04-13 18:20:31,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:31,435 INFO L278 IsEmpty]: Start isEmpty. Operand 15371 states and 64741 transitions. [2025-04-13 18:20:31,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:31,470 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:31,470 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 18:20:31,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:20:31,470 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:31,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1326548610, now seen corresponding path program 6 times [2025-04-13 18:20:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:31,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046623712] [2025-04-13 18:20:31,470 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:31,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:31,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:31,488 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:31,488 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:20:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:31,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:31,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046623712] [2025-04-13 18:20:31,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046623712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:31,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:31,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737460890] [2025-04-13 18:20:31,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:31,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:31,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:31,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:31,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:31,640 INFO L87 Difference]: Start difference. First operand 15371 states and 64741 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:32,907 INFO L93 Difference]: Finished difference Result 32766 states and 138029 transitions. [2025-04-13 18:20:32,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:20:32,907 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:32,907 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:33,031 INFO L225 Difference]: With dead ends: 32766 [2025-04-13 18:20:33,031 INFO L226 Difference]: Without dead ends: 28602 [2025-04-13 18:20:33,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:20:33,050 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 325 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:33,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 228 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:20:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28602 states. [2025-04-13 18:20:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28602 to 15785. [2025-04-13 18:20:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15785 states, 15784 states have (on average 4.214647744551445) internal successors, (66524), 15784 states have internal predecessors, (66524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15785 states to 15785 states and 66524 transitions. [2025-04-13 18:20:33,673 INFO L79 Accepts]: Start accepts. Automaton has 15785 states and 66524 transitions. Word has length 44 [2025-04-13 18:20:33,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:33,674 INFO L485 AbstractCegarLoop]: Abstraction has 15785 states and 66524 transitions. [2025-04-13 18:20:33,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:33,674 INFO L278 IsEmpty]: Start isEmpty. Operand 15785 states and 66524 transitions. [2025-04-13 18:20:33,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:33,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:33,715 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 18:20:33,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:20:33,715 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:33,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1833849694, now seen corresponding path program 7 times [2025-04-13 18:20:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:33,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554917491] [2025-04-13 18:20:33,716 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:20:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:33,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:33,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:33,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:33,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:33,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:33,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554917491] [2025-04-13 18:20:33,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554917491] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:33,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:33,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:20:33,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778472855] [2025-04-13 18:20:33,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:33,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:20:33,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:33,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:20:33,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:20:33,931 INFO L87 Difference]: Start difference. First operand 15785 states and 66524 transitions. Second operand has 6 states, 5 states have (on average 8.8) 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 18:20:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:34,409 INFO L93 Difference]: Finished difference Result 20208 states and 85244 transitions. [2025-04-13 18:20:34,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:20:34,409 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) 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 44 [2025-04-13 18:20:34,409 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:34,482 INFO L225 Difference]: With dead ends: 20208 [2025-04-13 18:20:34,482 INFO L226 Difference]: Without dead ends: 12711 [2025-04-13 18:20:34,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:20:34,498 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 165 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:34,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 78 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 18:20:34,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2025-04-13 18:20:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12343. [2025-04-13 18:20:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12343 states, 12342 states have (on average 4.145924485496678) internal successors, (51169), 12342 states have internal predecessors, (51169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12343 states to 12343 states and 51169 transitions. [2025-04-13 18:20:34,787 INFO L79 Accepts]: Start accepts. Automaton has 12343 states and 51169 transitions. Word has length 44 [2025-04-13 18:20:34,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:34,787 INFO L485 AbstractCegarLoop]: Abstraction has 12343 states and 51169 transitions. [2025-04-13 18:20:34,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) 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 18:20:34,787 INFO L278 IsEmpty]: Start isEmpty. Operand 12343 states and 51169 transitions. [2025-04-13 18:20:34,814 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:34,814 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:34,814 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 18:20:34,815 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:20:34,815 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:34,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:34,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1900192192, now seen corresponding path program 8 times [2025-04-13 18:20:34,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:34,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583387334] [2025-04-13 18:20:34,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:34,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:34,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:34,833 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:34,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:34,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:35,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:35,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583387334] [2025-04-13 18:20:35,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583387334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:35,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:35,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:35,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185734037] [2025-04-13 18:20:35,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:35,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:35,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:35,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:35,036 INFO L87 Difference]: Start difference. First operand 12343 states and 51169 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:35,927 INFO L93 Difference]: Finished difference Result 24596 states and 103776 transitions. [2025-04-13 18:20:35,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:20:35,927 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:35,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:36,033 INFO L225 Difference]: With dead ends: 24596 [2025-04-13 18:20:36,033 INFO L226 Difference]: Without dead ends: 20432 [2025-04-13 18:20:36,049 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:20:36,049 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 333 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:36,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 158 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:20:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20432 states. [2025-04-13 18:20:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20432 to 12644. [2025-04-13 18:20:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12644 states, 12643 states have (on average 4.145218698093807) internal successors, (52408), 12643 states have internal predecessors, (52408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12644 states to 12644 states and 52408 transitions. [2025-04-13 18:20:36,540 INFO L79 Accepts]: Start accepts. Automaton has 12644 states and 52408 transitions. Word has length 44 [2025-04-13 18:20:36,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:36,540 INFO L485 AbstractCegarLoop]: Abstraction has 12644 states and 52408 transitions. [2025-04-13 18:20:36,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:36,540 INFO L278 IsEmpty]: Start isEmpty. Operand 12644 states and 52408 transitions. [2025-04-13 18:20:36,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:36,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:36,569 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 18:20:36,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:20:36,569 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:36,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1178552728, now seen corresponding path program 9 times [2025-04-13 18:20:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:36,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720848926] [2025-04-13 18:20:36,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:36,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:36,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:36,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:36,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:36,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720848926] [2025-04-13 18:20:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720848926] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:36,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:36,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:20:36,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9756170] [2025-04-13 18:20:36,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:36,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:20:36,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:36,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:20:36,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:20:36,705 INFO L87 Difference]: Start difference. First operand 12644 states and 52408 transitions. Second operand has 5 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 18:20:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:36,937 INFO L93 Difference]: Finished difference Result 15211 states and 63357 transitions. [2025-04-13 18:20:36,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:20:36,937 INFO L79 Accepts]: Start accepts. Automaton has has 5 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 44 [2025-04-13 18:20:36,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:37,007 INFO L225 Difference]: With dead ends: 15211 [2025-04-13 18:20:37,007 INFO L226 Difference]: Without dead ends: 10788 [2025-04-13 18:20:37,018 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:37,018 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 93 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:37,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:20:37,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10788 states. [2025-04-13 18:20:37,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10788 to 10788. [2025-04-13 18:20:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10788 states, 10787 states have (on average 4.060257717623065) internal successors, (43798), 10787 states have internal predecessors, (43798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10788 states to 10788 states and 43798 transitions. [2025-04-13 18:20:37,347 INFO L79 Accepts]: Start accepts. Automaton has 10788 states and 43798 transitions. Word has length 44 [2025-04-13 18:20:37,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:37,348 INFO L485 AbstractCegarLoop]: Abstraction has 10788 states and 43798 transitions. [2025-04-13 18:20:37,348 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 18:20:37,348 INFO L278 IsEmpty]: Start isEmpty. Operand 10788 states and 43798 transitions. [2025-04-13 18:20:37,371 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:37,371 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:37,371 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 18:20:37,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:20:37,371 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:37,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 191519520, now seen corresponding path program 10 times [2025-04-13 18:20:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:37,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146046342] [2025-04-13 18:20:37,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:37,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:37,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:20:37,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:20:37,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:37,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:37,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146046342] [2025-04-13 18:20:37,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146046342] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:37,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:20:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465238379] [2025-04-13 18:20:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:37,516 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:20:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:37,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:20:37,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:20:37,517 INFO L87 Difference]: Start difference. First operand 10788 states and 43798 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:38,732 INFO L93 Difference]: Finished difference Result 31468 states and 135589 transitions. [2025-04-13 18:20:38,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:20:38,732 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 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 44 [2025-04-13 18:20:38,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:39,022 INFO L225 Difference]: With dead ends: 31468 [2025-04-13 18:20:39,023 INFO L226 Difference]: Without dead ends: 28128 [2025-04-13 18:20:39,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:20:39,033 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 487 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:39,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 242 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:20:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28128 states. [2025-04-13 18:20:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28128 to 12488. [2025-04-13 18:20:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12488 states, 12487 states have (on average 4.083606951229278) internal successors, (50992), 12487 states have internal predecessors, (50992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12488 states to 12488 states and 50992 transitions. [2025-04-13 18:20:39,400 INFO L79 Accepts]: Start accepts. Automaton has 12488 states and 50992 transitions. Word has length 44 [2025-04-13 18:20:39,400 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:39,401 INFO L485 AbstractCegarLoop]: Abstraction has 12488 states and 50992 transitions. [2025-04-13 18:20:39,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:39,401 INFO L278 IsEmpty]: Start isEmpty. Operand 12488 states and 50992 transitions. [2025-04-13 18:20:39,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:39,425 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:39,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:20:39,425 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:20:39,425 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:39,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:39,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1706502302, now seen corresponding path program 11 times [2025-04-13 18:20:39,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:39,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052237874] [2025-04-13 18:20:39,425 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:39,430 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:39,435 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:39,435 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:20:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:39,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052237874] [2025-04-13 18:20:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052237874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:39,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:39,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:20:39,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961444145] [2025-04-13 18:20:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:39,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:20:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:39,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:20:39,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:20:39,679 INFO L87 Difference]: Start difference. First operand 12488 states and 50992 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:41,159 INFO L93 Difference]: Finished difference Result 31319 states and 134031 transitions. [2025-04-13 18:20:41,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:20:41,159 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 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 44 [2025-04-13 18:20:41,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:41,274 INFO L225 Difference]: With dead ends: 31319 [2025-04-13 18:20:41,274 INFO L226 Difference]: Without dead ends: 26114 [2025-04-13 18:20:41,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=2017, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:20:41,291 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 528 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:41,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 468 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:20:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26114 states. [2025-04-13 18:20:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26114 to 13750. [2025-04-13 18:20:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13750 states, 13749 states have (on average 4.08793366790312) internal successors, (56205), 13749 states have internal predecessors, (56205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13750 states to 13750 states and 56205 transitions. [2025-04-13 18:20:41,754 INFO L79 Accepts]: Start accepts. Automaton has 13750 states and 56205 transitions. Word has length 44 [2025-04-13 18:20:41,754 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:41,754 INFO L485 AbstractCegarLoop]: Abstraction has 13750 states and 56205 transitions. [2025-04-13 18:20:41,754 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:41,754 INFO L278 IsEmpty]: Start isEmpty. Operand 13750 states and 56205 transitions. [2025-04-13 18:20:41,781 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:41,781 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:41,781 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 18:20:41,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 18:20:41,781 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:41,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:41,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1364250846, now seen corresponding path program 12 times [2025-04-13 18:20:41,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:41,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595316755] [2025-04-13 18:20:41,782 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:20:41,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:41,786 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:41,791 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:41,791 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:20:41,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:41,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595316755] [2025-04-13 18:20:41,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595316755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:41,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:41,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:41,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991291629] [2025-04-13 18:20:41,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:41,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:41,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:41,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:41,904 INFO L87 Difference]: Start difference. First operand 13750 states and 56205 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:42,505 INFO L93 Difference]: Finished difference Result 24550 states and 101965 transitions. [2025-04-13 18:20:42,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 18:20:42,505 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:42,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:42,601 INFO L225 Difference]: With dead ends: 24550 [2025-04-13 18:20:42,602 INFO L226 Difference]: Without dead ends: 20762 [2025-04-13 18:20:42,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:20:42,615 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 291 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:42,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 152 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:20:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20762 states. [2025-04-13 18:20:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20762 to 12962. [2025-04-13 18:20:43,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12962 states, 12961 states have (on average 4.081012267571946) internal successors, (52894), 12961 states have internal predecessors, (52894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12962 states to 12962 states and 52894 transitions. [2025-04-13 18:20:43,216 INFO L79 Accepts]: Start accepts. Automaton has 12962 states and 52894 transitions. Word has length 44 [2025-04-13 18:20:43,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:43,216 INFO L485 AbstractCegarLoop]: Abstraction has 12962 states and 52894 transitions. [2025-04-13 18:20:43,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:43,216 INFO L278 IsEmpty]: Start isEmpty. Operand 12962 states and 52894 transitions. [2025-04-13 18:20:43,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:43,248 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:43,248 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 18:20:43,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 18:20:43,248 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:43,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:43,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1108307812, now seen corresponding path program 13 times [2025-04-13 18:20:43,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:43,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953196516] [2025-04-13 18:20:43,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:20:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:43,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:20:43,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:43,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:43,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:43,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:43,511 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953196516] [2025-04-13 18:20:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953196516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:43,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:43,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:20:43,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49860642] [2025-04-13 18:20:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:43,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:20:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:43,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:20:43,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:20:43,512 INFO L87 Difference]: Start difference. First operand 12962 states and 52894 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:45,136 INFO L93 Difference]: Finished difference Result 31231 states and 131484 transitions. [2025-04-13 18:20:45,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:20:45,137 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 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 44 [2025-04-13 18:20:45,137 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:45,290 INFO L225 Difference]: With dead ends: 31231 [2025-04-13 18:20:45,290 INFO L226 Difference]: Without dead ends: 28893 [2025-04-13 18:20:45,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=398, Invalid=1764, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:20:45,308 INFO L437 NwaCegarLoop]: 68 mSDtfsCounter, 473 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:45,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 474 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:20:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28893 states. [2025-04-13 18:20:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28893 to 12978. [2025-04-13 18:20:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12978 states, 12977 states have (on average 4.08029590814518) internal successors, (52950), 12977 states have internal predecessors, (52950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12978 states to 12978 states and 52950 transitions. [2025-04-13 18:20:45,766 INFO L79 Accepts]: Start accepts. Automaton has 12978 states and 52950 transitions. Word has length 44 [2025-04-13 18:20:45,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:45,767 INFO L485 AbstractCegarLoop]: Abstraction has 12978 states and 52950 transitions. [2025-04-13 18:20:45,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:45,767 INFO L278 IsEmpty]: Start isEmpty. Operand 12978 states and 52950 transitions. [2025-04-13 18:20:45,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:45,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:45,793 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 18:20:45,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 18:20:45,793 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:45,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash -876706974, now seen corresponding path program 14 times [2025-04-13 18:20:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:45,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241043849] [2025-04-13 18:20:45,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:45,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:45,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:45,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:45,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:45,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:45,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241043849] [2025-04-13 18:20:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241043849] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:45,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784557467] [2025-04-13 18:20:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:45,899 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:45,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:45,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:45,899 INFO L87 Difference]: Start difference. First operand 12978 states and 52950 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:46,628 INFO L93 Difference]: Finished difference Result 20229 states and 83738 transitions. [2025-04-13 18:20:46,628 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:20:46,628 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:46,628 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:46,722 INFO L225 Difference]: With dead ends: 20229 [2025-04-13 18:20:46,722 INFO L226 Difference]: Without dead ends: 16921 [2025-04-13 18:20:46,733 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-04-13 18:20:46,733 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 258 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:46,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 155 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:20:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16921 states. [2025-04-13 18:20:46,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16921 to 12978. [2025-04-13 18:20:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12978 states, 12977 states have (on average 4.08029590814518) internal successors, (52950), 12977 states have internal predecessors, (52950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12978 states to 12978 states and 52950 transitions. [2025-04-13 18:20:47,014 INFO L79 Accepts]: Start accepts. Automaton has 12978 states and 52950 transitions. Word has length 44 [2025-04-13 18:20:47,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:47,014 INFO L485 AbstractCegarLoop]: Abstraction has 12978 states and 52950 transitions. [2025-04-13 18:20:47,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:47,014 INFO L278 IsEmpty]: Start isEmpty. Operand 12978 states and 52950 transitions. [2025-04-13 18:20:47,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:47,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:47,037 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 18:20:47,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 18:20:47,037 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:47,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:47,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1838524266, now seen corresponding path program 15 times [2025-04-13 18:20:47,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:47,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363722875] [2025-04-13 18:20:47,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:47,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:47,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:47,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 43 of 44 statements. [2025-04-13 18:20:47,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:47,201 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363722875] [2025-04-13 18:20:47,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363722875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:47,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:47,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:20:47,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839926397] [2025-04-13 18:20:47,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:47,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:20:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:47,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:20:47,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:20:47,202 INFO L87 Difference]: Start difference. First operand 12978 states and 52950 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:48,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:48,557 INFO L93 Difference]: Finished difference Result 30801 states and 130542 transitions. [2025-04-13 18:20:48,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 18:20:48,558 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 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 44 [2025-04-13 18:20:48,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:48,721 INFO L225 Difference]: With dead ends: 30801 [2025-04-13 18:20:48,721 INFO L226 Difference]: Without dead ends: 27998 [2025-04-13 18:20:48,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=1874, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:20:48,738 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 552 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:48,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 423 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:20:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27998 states. [2025-04-13 18:20:49,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27998 to 12958. [2025-04-13 18:20:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12958 states, 12957 states have (on average 4.0808057420699235) internal successors, (52875), 12957 states have internal predecessors, (52875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:49,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 52875 transitions. [2025-04-13 18:20:49,193 INFO L79 Accepts]: Start accepts. Automaton has 12958 states and 52875 transitions. Word has length 44 [2025-04-13 18:20:49,193 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:49,193 INFO L485 AbstractCegarLoop]: Abstraction has 12958 states and 52875 transitions. [2025-04-13 18:20:49,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:49,194 INFO L278 IsEmpty]: Start isEmpty. Operand 12958 states and 52875 transitions. [2025-04-13 18:20:49,219 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:49,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:49,220 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 18:20:49,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 18:20:49,220 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:49,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:49,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1157260418, now seen corresponding path program 16 times [2025-04-13 18:20:49,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:49,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-13 18:20:49,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:49,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:49,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 44 statements. [2025-04-13 18:20:49,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:20:49,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:49,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48472783] [2025-04-13 18:20:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48472783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:49,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:20:49,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359331494] [2025-04-13 18:20:49,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:49,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:20:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:20:49,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:20:49,271 INFO L87 Difference]: Start difference. First operand 12958 states and 52875 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:49,609 INFO L93 Difference]: Finished difference Result 25815 states and 108292 transitions. [2025-04-13 18:20:49,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:20:49,609 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 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 44 [2025-04-13 18:20:49,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:49,816 INFO L225 Difference]: With dead ends: 25815 [2025-04-13 18:20:49,816 INFO L226 Difference]: Without dead ends: 18515 [2025-04-13 18:20:49,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:49,825 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 150 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:49,826 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 115 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:20:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18515 states. [2025-04-13 18:20:50,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18515 to 16577. [2025-04-13 18:20:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16577 states, 16576 states have (on average 4.054657335907336) internal successors, (67210), 16576 states have internal predecessors, (67210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 67210 transitions. [2025-04-13 18:20:50,178 INFO L79 Accepts]: Start accepts. Automaton has 16577 states and 67210 transitions. Word has length 44 [2025-04-13 18:20:50,178 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:50,178 INFO L485 AbstractCegarLoop]: Abstraction has 16577 states and 67210 transitions. [2025-04-13 18:20:50,178 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:50,178 INFO L278 IsEmpty]: Start isEmpty. Operand 16577 states and 67210 transitions. [2025-04-13 18:20:50,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:20:50,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:50,207 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 18:20:50,207 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 18:20:50,207 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:50,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:50,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1922437136, now seen corresponding path program 17 times [2025-04-13 18:20:50,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:50,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770827582] [2025-04-13 18:20:50,208 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:20:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:50,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:20:50,215 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:20:50,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:20:50,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:50,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:50,300 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770827582] [2025-04-13 18:20:50,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770827582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:50,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:50,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:20:50,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410561795] [2025-04-13 18:20:50,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:50,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:20:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:50,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:20:50,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:20:50,301 INFO L87 Difference]: Start difference. First operand 16577 states and 67210 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:50,984 INFO L93 Difference]: Finished difference Result 25457 states and 104839 transitions. [2025-04-13 18:20:50,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 18:20:50,984 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 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 44 [2025-04-13 18:20:50,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:51,093 INFO L225 Difference]: With dead ends: 25457 [2025-04-13 18:20:51,093 INFO L226 Difference]: Without dead ends: 21362 [2025-04-13 18:20:51,106 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2025-04-13 18:20:51,106 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 347 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:51,107 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 170 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:20:51,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21362 states. [2025-04-13 18:20:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21362 to 15917. [2025-04-13 18:20:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15917 states, 15916 states have (on average 4.06151042975622) internal successors, (64643), 15916 states have internal predecessors, (64643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15917 states to 15917 states and 64643 transitions. [2025-04-13 18:20:51,633 INFO L79 Accepts]: Start accepts. Automaton has 15917 states and 64643 transitions. Word has length 44 [2025-04-13 18:20:51,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:51,633 INFO L485 AbstractCegarLoop]: Abstraction has 15917 states and 64643 transitions. [2025-04-13 18:20:51,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:51,633 INFO L278 IsEmpty]: Start isEmpty. Operand 15917 states and 64643 transitions. [2025-04-13 18:20:51,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:20:51,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:51,665 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, 1] [2025-04-13 18:20:51,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 18:20:51,665 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:51,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1168902023, now seen corresponding path program 1 times [2025-04-13 18:20:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:51,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340956756] [2025-04-13 18:20:51,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:20:51,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:51,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:20:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:20:51,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:20:51,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:51,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:51,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340956756] [2025-04-13 18:20:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340956756] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:51,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:51,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:20:51,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488545619] [2025-04-13 18:20:51,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:51,838 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:20:51,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:51,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:20:51,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:20:51,838 INFO L87 Difference]: Start difference. First operand 15917 states and 64643 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:53,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:53,332 INFO L93 Difference]: Finished difference Result 41292 states and 177588 transitions. [2025-04-13 18:20:53,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:20:53,333 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:20:53,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:53,531 INFO L225 Difference]: With dead ends: 41292 [2025-04-13 18:20:53,531 INFO L226 Difference]: Without dead ends: 36778 [2025-04-13 18:20:53,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=329, Invalid=1477, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:20:53,553 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 659 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 2435 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:53,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 489 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2435 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:20:53,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36778 states. [2025-04-13 18:20:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36778 to 18529. [2025-04-13 18:20:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18529 states, 18528 states have (on average 4.077126511226252) internal successors, (75541), 18528 states have internal predecessors, (75541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18529 states to 18529 states and 75541 transitions. [2025-04-13 18:20:54,123 INFO L79 Accepts]: Start accepts. Automaton has 18529 states and 75541 transitions. Word has length 45 [2025-04-13 18:20:54,124 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:54,124 INFO L485 AbstractCegarLoop]: Abstraction has 18529 states and 75541 transitions. [2025-04-13 18:20:54,124 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:54,124 INFO L278 IsEmpty]: Start isEmpty. Operand 18529 states and 75541 transitions. [2025-04-13 18:20:54,159 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:20:54,159 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:54,159 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, 1] [2025-04-13 18:20:54,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 18:20:54,159 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:54,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -981114201, now seen corresponding path program 2 times [2025-04-13 18:20:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:54,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88691695] [2025-04-13 18:20:54,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:20:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:54,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:20:54,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:20:54,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:20:54,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:54,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88691695] [2025-04-13 18:20:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88691695] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:20:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415832201] [2025-04-13 18:20:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:54,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:20:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:20:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:20:54,344 INFO L87 Difference]: Start difference. First operand 18529 states and 75541 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:56,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:56,205 INFO L93 Difference]: Finished difference Result 41215 states and 176628 transitions. [2025-04-13 18:20:56,205 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:20:56,205 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:20:56,205 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:56,416 INFO L225 Difference]: With dead ends: 41215 [2025-04-13 18:20:56,417 INFO L226 Difference]: Without dead ends: 37630 [2025-04-13 18:20:56,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=2200, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 18:20:56,436 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 737 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:56,436 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 571 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:20:56,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37630 states. [2025-04-13 18:20:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37630 to 18589. [2025-04-13 18:20:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18589 states, 18588 states have (on average 4.07580159242522) internal successors, (75761), 18588 states have internal predecessors, (75761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:57,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 75761 transitions. [2025-04-13 18:20:57,247 INFO L79 Accepts]: Start accepts. Automaton has 18589 states and 75761 transitions. Word has length 45 [2025-04-13 18:20:57,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:57,247 INFO L485 AbstractCegarLoop]: Abstraction has 18589 states and 75761 transitions. [2025-04-13 18:20:57,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:57,247 INFO L278 IsEmpty]: Start isEmpty. Operand 18589 states and 75761 transitions. [2025-04-13 18:20:57,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:20:57,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:57,285 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, 1] [2025-04-13 18:20:57,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 18:20:57,286 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:57,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:57,286 INFO L85 PathProgramCache]: Analyzing trace with hash 25439967, now seen corresponding path program 3 times [2025-04-13 18:20:57,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:57,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707322753] [2025-04-13 18:20:57,286 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:20:57,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:57,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:20:57,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:20:57,294 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:20:57,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:20:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:20:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:20:57,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707322753] [2025-04-13 18:20:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707322753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:20:57,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:20:57,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:20:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739683626] [2025-04-13 18:20:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:20:57,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:20:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:20:57,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:20:57,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:20:57,447 INFO L87 Difference]: Start difference. First operand 18589 states and 75761 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:20:58,789 INFO L93 Difference]: Finished difference Result 38541 states and 164223 transitions. [2025-04-13 18:20:58,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:20:58,790 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:20:58,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:20:58,998 INFO L225 Difference]: With dead ends: 38541 [2025-04-13 18:20:58,998 INFO L226 Difference]: Without dead ends: 34954 [2025-04-13 18:20:59,009 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=1502, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:20:59,010 INFO L437 NwaCegarLoop]: 63 mSDtfsCounter, 580 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 2124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:59,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 480 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2124 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:20:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34954 states. [2025-04-13 18:20:59,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34954 to 19049. [2025-04-13 18:20:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19049 states, 19048 states have (on average 4.074496010079798) internal successors, (77611), 19048 states have internal predecessors, (77611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19049 states to 19049 states and 77611 transitions. [2025-04-13 18:20:59,592 INFO L79 Accepts]: Start accepts. Automaton has 19049 states and 77611 transitions. Word has length 45 [2025-04-13 18:20:59,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:20:59,593 INFO L485 AbstractCegarLoop]: Abstraction has 19049 states and 77611 transitions. [2025-04-13 18:20:59,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:20:59,593 INFO L278 IsEmpty]: Start isEmpty. Operand 19049 states and 77611 transitions. [2025-04-13 18:20:59,629 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:20:59,629 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:20:59,629 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, 1] [2025-04-13 18:20:59,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 18:20:59,629 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:20:59,630 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:20:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 497004207, now seen corresponding path program 4 times [2025-04-13 18:20:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:20:59,630 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695645552] [2025-04-13 18:20:59,630 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:20:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:20:59,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:20:59,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:20:59,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:20:59,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:00,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695645552] [2025-04-13 18:21:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695645552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:00,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271491337] [2025-04-13 18:21:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:00,003 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:00,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:00,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:00,003 INFO L87 Difference]: Start difference. First operand 19049 states and 77611 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:01,584 INFO L93 Difference]: Finished difference Result 46312 states and 196862 transitions. [2025-04-13 18:21:01,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 18:21:01,584 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:01,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:02,036 INFO L225 Difference]: With dead ends: 46312 [2025-04-13 18:21:02,037 INFO L226 Difference]: Without dead ends: 42511 [2025-04-13 18:21:02,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=1503, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:21:02,050 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 597 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:02,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 531 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42511 states. [2025-04-13 18:21:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42511 to 21669. [2025-04-13 18:21:02,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21669 states, 21668 states have (on average 4.085794720324903) internal successors, (88531), 21668 states have internal predecessors, (88531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:02,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21669 states to 21669 states and 88531 transitions. [2025-04-13 18:21:02,773 INFO L79 Accepts]: Start accepts. Automaton has 21669 states and 88531 transitions. Word has length 45 [2025-04-13 18:21:02,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:02,773 INFO L485 AbstractCegarLoop]: Abstraction has 21669 states and 88531 transitions. [2025-04-13 18:21:02,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:02,773 INFO L278 IsEmpty]: Start isEmpty. Operand 21669 states and 88531 transitions. [2025-04-13 18:21:02,980 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:02,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:02,980 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, 1] [2025-04-13 18:21:02,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 18:21:02,981 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:02,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1966678225, now seen corresponding path program 5 times [2025-04-13 18:21:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:02,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551106443] [2025-04-13 18:21:02,981 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:02,986 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:02,991 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:02,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:02,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:03,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:03,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551106443] [2025-04-13 18:21:03,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551106443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:03,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978134678] [2025-04-13 18:21:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:03,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:03,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:03,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:03,170 INFO L87 Difference]: Start difference. First operand 21669 states and 88531 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:04,991 INFO L93 Difference]: Finished difference Result 45186 states and 192000 transitions. [2025-04-13 18:21:04,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:21:04,991 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:04,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:05,233 INFO L225 Difference]: With dead ends: 45186 [2025-04-13 18:21:05,233 INFO L226 Difference]: Without dead ends: 42196 [2025-04-13 18:21:05,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=2074, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 18:21:05,250 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 668 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:05,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 606 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:21:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42196 states. [2025-04-13 18:21:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42196 to 21029. [2025-04-13 18:21:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21029 states, 21028 states have (on average 4.0665303404983835) internal successors, (85511), 21028 states have internal predecessors, (85511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21029 states to 21029 states and 85511 transitions. [2025-04-13 18:21:06,206 INFO L79 Accepts]: Start accepts. Automaton has 21029 states and 85511 transitions. Word has length 45 [2025-04-13 18:21:06,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:06,207 INFO L485 AbstractCegarLoop]: Abstraction has 21029 states and 85511 transitions. [2025-04-13 18:21:06,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:06,207 INFO L278 IsEmpty]: Start isEmpty. Operand 21029 states and 85511 transitions. [2025-04-13 18:21:06,254 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:06,254 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:06,254 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, 1] [2025-04-13 18:21:06,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 18:21:06,254 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:06,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:06,255 INFO L85 PathProgramCache]: Analyzing trace with hash -725134821, now seen corresponding path program 6 times [2025-04-13 18:21:06,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:06,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063470080] [2025-04-13 18:21:06,255 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:06,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:06,259 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:06,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:06,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:06,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:06,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:06,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063470080] [2025-04-13 18:21:06,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063470080] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:06,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:06,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043598584] [2025-04-13 18:21:06,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:06,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:06,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:06,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:06,503 INFO L87 Difference]: Start difference. First operand 21029 states and 85511 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:08,026 INFO L93 Difference]: Finished difference Result 41850 states and 176696 transitions. [2025-04-13 18:21:08,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:21:08,026 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:08,026 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:08,285 INFO L225 Difference]: With dead ends: 41850 [2025-04-13 18:21:08,285 INFO L226 Difference]: Without dead ends: 38786 [2025-04-13 18:21:08,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=1379, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:21:08,308 INFO L437 NwaCegarLoop]: 64 mSDtfsCounter, 564 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:08,308 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 535 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38786 states. [2025-04-13 18:21:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38786 to 19081. [2025-04-13 18:21:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19081 states, 19080 states have (on average 4.0735324947589096) internal successors, (77723), 19080 states have internal predecessors, (77723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19081 states to 19081 states and 77723 transitions. [2025-04-13 18:21:09,141 INFO L79 Accepts]: Start accepts. Automaton has 19081 states and 77723 transitions. Word has length 45 [2025-04-13 18:21:09,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:09,142 INFO L485 AbstractCegarLoop]: Abstraction has 19081 states and 77723 transitions. [2025-04-13 18:21:09,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:09,142 INFO L278 IsEmpty]: Start isEmpty. Operand 19081 states and 77723 transitions. [2025-04-13 18:21:09,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:09,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:09,180 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, 1] [2025-04-13 18:21:09,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 18:21:09,180 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:09,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1431374235, now seen corresponding path program 7 times [2025-04-13 18:21:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:09,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95359691] [2025-04-13 18:21:09,181 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:09,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:09,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:09,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:09,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:09,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:09,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95359691] [2025-04-13 18:21:09,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95359691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:09,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:09,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:09,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415376058] [2025-04-13 18:21:09,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:09,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:09,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:09,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:09,446 INFO L87 Difference]: Start difference. First operand 19081 states and 77723 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:10,864 INFO L93 Difference]: Finished difference Result 37904 states and 162079 transitions. [2025-04-13 18:21:10,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:21:10,864 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:10,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:11,059 INFO L225 Difference]: With dead ends: 37904 [2025-04-13 18:21:11,059 INFO L226 Difference]: Without dead ends: 33390 [2025-04-13 18:21:11,078 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1766, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:21:11,079 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 589 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:11,079 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 515 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33390 states. [2025-04-13 18:21:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33390 to 21381. [2025-04-13 18:21:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21381 states, 21380 states have (on average 4.088072965388213) internal successors, (87403), 21380 states have internal predecessors, (87403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21381 states to 21381 states and 87403 transitions. [2025-04-13 18:21:11,817 INFO L79 Accepts]: Start accepts. Automaton has 21381 states and 87403 transitions. Word has length 45 [2025-04-13 18:21:11,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:11,817 INFO L485 AbstractCegarLoop]: Abstraction has 21381 states and 87403 transitions. [2025-04-13 18:21:11,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:11,817 INFO L278 IsEmpty]: Start isEmpty. Operand 21381 states and 87403 transitions. [2025-04-13 18:21:11,858 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:11,858 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:11,858 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, 1] [2025-04-13 18:21:11,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 18:21:11,859 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:11,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash 884083593, now seen corresponding path program 8 times [2025-04-13 18:21:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:11,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687961717] [2025-04-13 18:21:11,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:11,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:11,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:11,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:11,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:12,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:12,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687961717] [2025-04-13 18:21:12,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687961717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:12,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:12,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987121620] [2025-04-13 18:21:12,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:12,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:12,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:12,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:12,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:12,124 INFO L87 Difference]: Start difference. First operand 21381 states and 87403 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:13,738 INFO L93 Difference]: Finished difference Result 37827 states and 161119 transitions. [2025-04-13 18:21:13,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 18:21:13,739 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:13,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:13,925 INFO L225 Difference]: With dead ends: 37827 [2025-04-13 18:21:13,925 INFO L226 Difference]: Without dead ends: 34242 [2025-04-13 18:21:13,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=417, Invalid=2553, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:21:13,944 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 725 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:13,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 552 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34242 states. [2025-04-13 18:21:14,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34242 to 20741. [2025-04-13 18:21:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20741 states, 20740 states have (on average 4.06861137897782) internal successors, (84383), 20740 states have internal predecessors, (84383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20741 states to 20741 states and 84383 transitions. [2025-04-13 18:21:14,594 INFO L79 Accepts]: Start accepts. Automaton has 20741 states and 84383 transitions. Word has length 45 [2025-04-13 18:21:14,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:14,594 INFO L485 AbstractCegarLoop]: Abstraction has 20741 states and 84383 transitions. [2025-04-13 18:21:14,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:14,595 INFO L278 IsEmpty]: Start isEmpty. Operand 20741 states and 84383 transitions. [2025-04-13 18:21:14,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:14,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:14,635 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, 1] [2025-04-13 18:21:14,635 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 18:21:14,635 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:14,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1669251071, now seen corresponding path program 9 times [2025-04-13 18:21:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:14,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398880827] [2025-04-13 18:21:14,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:14,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:14,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:14,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:14,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398880827] [2025-04-13 18:21:14,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398880827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:14,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:14,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:14,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404945517] [2025-04-13 18:21:14,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:14,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:14,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:14,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:14,801 INFO L87 Difference]: Start difference. First operand 20741 states and 84383 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:15,887 INFO L93 Difference]: Finished difference Result 33061 states and 138777 transitions. [2025-04-13 18:21:15,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:21:15,888 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:15,888 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:16,074 INFO L225 Difference]: With dead ends: 33061 [2025-04-13 18:21:16,074 INFO L226 Difference]: Without dead ends: 30666 [2025-04-13 18:21:16,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=1129, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:21:16,091 INFO L437 NwaCegarLoop]: 60 mSDtfsCounter, 464 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:16,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 460 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:16,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30666 states. [2025-04-13 18:21:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30666 to 19121. [2025-04-13 18:21:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19121 states, 19120 states have (on average 4.0728556485355645) internal successors, (77873), 19120 states have internal predecessors, (77873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19121 states to 19121 states and 77873 transitions. [2025-04-13 18:21:16,675 INFO L79 Accepts]: Start accepts. Automaton has 19121 states and 77873 transitions. Word has length 45 [2025-04-13 18:21:16,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:16,676 INFO L485 AbstractCegarLoop]: Abstraction has 19121 states and 77873 transitions. [2025-04-13 18:21:16,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:16,676 INFO L278 IsEmpty]: Start isEmpty. Operand 19121 states and 77873 transitions. [2025-04-13 18:21:16,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:16,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:16,713 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, 1] [2025-04-13 18:21:16,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 18:21:16,714 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:16,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:16,714 INFO L85 PathProgramCache]: Analyzing trace with hash -268482249, now seen corresponding path program 10 times [2025-04-13 18:21:16,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:16,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416823602] [2025-04-13 18:21:16,714 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:16,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:16,718 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:16,723 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:16,723 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:16,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:16,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:16,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416823602] [2025-04-13 18:21:16,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416823602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:16,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:16,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:16,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445266874] [2025-04-13 18:21:16,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:16,960 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:16,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:16,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:16,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:16,960 INFO L87 Difference]: Start difference. First operand 19121 states and 77873 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:18,396 INFO L93 Difference]: Finished difference Result 38116 states and 163126 transitions. [2025-04-13 18:21:18,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:21:18,396 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:18,396 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:18,601 INFO L225 Difference]: With dead ends: 38116 [2025-04-13 18:21:18,602 INFO L226 Difference]: Without dead ends: 33326 [2025-04-13 18:21:18,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1995, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:21:18,623 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 572 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:18,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 444 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:21:18,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33326 states. [2025-04-13 18:21:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33326 to 21281. [2025-04-13 18:21:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21281 states, 21280 states have (on average 4.089661654135338) internal successors, (87028), 21280 states have internal predecessors, (87028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21281 states to 21281 states and 87028 transitions. [2025-04-13 18:21:19,257 INFO L79 Accepts]: Start accepts. Automaton has 21281 states and 87028 transitions. Word has length 45 [2025-04-13 18:21:19,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:19,257 INFO L485 AbstractCegarLoop]: Abstraction has 21281 states and 87028 transitions. [2025-04-13 18:21:19,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:19,257 INFO L278 IsEmpty]: Start isEmpty. Operand 21281 states and 87028 transitions. [2025-04-13 18:21:19,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:19,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:19,295 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, 1] [2025-04-13 18:21:19,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 18:21:19,296 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:19,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1375421045, now seen corresponding path program 11 times [2025-04-13 18:21:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:19,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569461023] [2025-04-13 18:21:19,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:19,300 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:19,303 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:19,303 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:19,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:19,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:19,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:19,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569461023] [2025-04-13 18:21:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569461023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:19,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:19,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:19,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69033954] [2025-04-13 18:21:19,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:19,478 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:19,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:19,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:19,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:19,479 INFO L87 Difference]: Start difference. First operand 21281 states and 87028 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:21,267 INFO L93 Difference]: Finished difference Result 37763 states and 160902 transitions. [2025-04-13 18:21:21,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 18:21:21,267 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:21,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:21,470 INFO L225 Difference]: With dead ends: 37763 [2025-04-13 18:21:21,470 INFO L226 Difference]: Without dead ends: 34178 [2025-04-13 18:21:21,491 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 18:21:21,492 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 719 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 2822 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:21,492 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 521 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2822 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:21:21,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34178 states. [2025-04-13 18:21:21,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34178 to 20641. [2025-04-13 18:21:21,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20641 states, 20640 states have (on average 4.07015503875969) internal successors, (84008), 20640 states have internal predecessors, (84008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20641 states to 20641 states and 84008 transitions. [2025-04-13 18:21:22,164 INFO L79 Accepts]: Start accepts. Automaton has 20641 states and 84008 transitions. Word has length 45 [2025-04-13 18:21:22,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:22,164 INFO L485 AbstractCegarLoop]: Abstraction has 20641 states and 84008 transitions. [2025-04-13 18:21:22,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:22,164 INFO L278 IsEmpty]: Start isEmpty. Operand 20641 states and 84008 transitions. [2025-04-13 18:21:22,204 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:22,205 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, 1] [2025-04-13 18:21:22,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 18:21:22,205 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:22,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1490621277, now seen corresponding path program 12 times [2025-04-13 18:21:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:22,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577846556] [2025-04-13 18:21:22,205 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:22,211 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:22,213 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:22,213 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:22,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:22,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:22,379 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577846556] [2025-04-13 18:21:22,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577846556] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:22,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:22,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434832904] [2025-04-13 18:21:22,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:22,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:22,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:22,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:22,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:22,379 INFO L87 Difference]: Start difference. First operand 20641 states and 84008 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:23,550 INFO L93 Difference]: Finished difference Result 32948 states and 138363 transitions. [2025-04-13 18:21:23,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:21:23,550 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:23,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:23,742 INFO L225 Difference]: With dead ends: 32948 [2025-04-13 18:21:23,742 INFO L226 Difference]: Without dead ends: 30553 [2025-04-13 18:21:23,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:21:23,759 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 464 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:23,759 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 478 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:21:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30553 states. [2025-04-13 18:21:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30553 to 19341. [2025-04-13 18:21:24,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19341 states, 19340 states have (on average 4.0712512926577045) internal successors, (78738), 19340 states have internal predecessors, (78738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19341 states to 19341 states and 78738 transitions. [2025-04-13 18:21:24,356 INFO L79 Accepts]: Start accepts. Automaton has 19341 states and 78738 transitions. Word has length 45 [2025-04-13 18:21:24,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:24,356 INFO L485 AbstractCegarLoop]: Abstraction has 19341 states and 78738 transitions. [2025-04-13 18:21:24,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:24,357 INFO L278 IsEmpty]: Start isEmpty. Operand 19341 states and 78738 transitions. [2025-04-13 18:21:24,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:24,395 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:24,395 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, 1] [2025-04-13 18:21:24,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 18:21:24,395 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:24,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1853372913, now seen corresponding path program 13 times [2025-04-13 18:21:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:24,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537549688] [2025-04-13 18:21:24,395 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:24,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:24,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:24,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:24,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:24,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537549688] [2025-04-13 18:21:24,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537549688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:24,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:24,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:24,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525048227] [2025-04-13 18:21:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:24,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:24,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:24,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:24,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:24,563 INFO L87 Difference]: Start difference. First operand 19341 states and 78738 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:25,654 INFO L93 Difference]: Finished difference Result 34818 states and 146856 transitions. [2025-04-13 18:21:25,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:21:25,654 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:25,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:25,856 INFO L225 Difference]: With dead ends: 34818 [2025-04-13 18:21:25,856 INFO L226 Difference]: Without dead ends: 32279 [2025-04-13 18:21:25,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=1108, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:21:25,873 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 462 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:25,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 448 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2025-04-13 18:21:26,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 19421. [2025-04-13 18:21:26,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19421 states, 19420 states have (on average 4.071987641606591) internal successors, (79078), 19420 states have internal predecessors, (79078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19421 states to 19421 states and 79078 transitions. [2025-04-13 18:21:26,453 INFO L79 Accepts]: Start accepts. Automaton has 19421 states and 79078 transitions. Word has length 45 [2025-04-13 18:21:26,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:26,453 INFO L485 AbstractCegarLoop]: Abstraction has 19421 states and 79078 transitions. [2025-04-13 18:21:26,454 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:26,454 INFO L278 IsEmpty]: Start isEmpty. Operand 19421 states and 79078 transitions. [2025-04-13 18:21:26,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:26,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:26,489 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, 1] [2025-04-13 18:21:26,489 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 18:21:26,489 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:26,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash -85121129, now seen corresponding path program 14 times [2025-04-13 18:21:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:26,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227344458] [2025-04-13 18:21:26,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:26,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:26,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:26,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:26,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:26,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227344458] [2025-04-13 18:21:26,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227344458] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:26,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:26,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752288769] [2025-04-13 18:21:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:26,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:26,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:26,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:26,680 INFO L87 Difference]: Start difference. First operand 19421 states and 79078 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:28,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:28,151 INFO L93 Difference]: Finished difference Result 39798 states and 170695 transitions. [2025-04-13 18:21:28,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 18:21:28,151 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:28,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:28,367 INFO L225 Difference]: With dead ends: 39798 [2025-04-13 18:21:28,367 INFO L226 Difference]: Without dead ends: 36296 [2025-04-13 18:21:28,386 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=335, Invalid=1921, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 18:21:28,386 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 678 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:28,386 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 505 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36296 states. [2025-04-13 18:21:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36296 to 20061. [2025-04-13 18:21:28,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20061 states, 20060 states have (on average 4.092622133599202) internal successors, (82098), 20060 states have internal predecessors, (82098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20061 states to 20061 states and 82098 transitions. [2025-04-13 18:21:29,086 INFO L79 Accepts]: Start accepts. Automaton has 20061 states and 82098 transitions. Word has length 45 [2025-04-13 18:21:29,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:29,086 INFO L485 AbstractCegarLoop]: Abstraction has 20061 states and 82098 transitions. [2025-04-13 18:21:29,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:29,087 INFO L278 IsEmpty]: Start isEmpty. Operand 20061 states and 82098 transitions. [2025-04-13 18:21:29,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:29,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:29,125 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, 1] [2025-04-13 18:21:29,126 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 18:21:29,126 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:29,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1748087761, now seen corresponding path program 15 times [2025-04-13 18:21:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:29,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819079839] [2025-04-13 18:21:29,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:29,130 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:29,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:29,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:29,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:29,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:29,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819079839] [2025-04-13 18:21:29,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819079839] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:29,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:29,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:21:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558591664] [2025-04-13 18:21:29,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:29,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:21:29,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:29,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:21:29,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:21:29,315 INFO L87 Difference]: Start difference. First operand 20061 states and 82098 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:30,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:30,593 INFO L93 Difference]: Finished difference Result 32391 states and 137706 transitions. [2025-04-13 18:21:30,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 18:21:30,594 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:30,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:30,969 INFO L225 Difference]: With dead ends: 32391 [2025-04-13 18:21:30,969 INFO L226 Difference]: Without dead ends: 29805 [2025-04-13 18:21:30,979 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=1257, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:21:30,980 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 554 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:30,980 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 505 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29805 states. [2025-04-13 18:21:31,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29805 to 20421. [2025-04-13 18:21:31,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20421 states, 20420 states have (on average 4.091968658178256) internal successors, (83558), 20420 states have internal predecessors, (83558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20421 states to 20421 states and 83558 transitions. [2025-04-13 18:21:31,594 INFO L79 Accepts]: Start accepts. Automaton has 20421 states and 83558 transitions. Word has length 45 [2025-04-13 18:21:31,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:31,594 INFO L485 AbstractCegarLoop]: Abstraction has 20421 states and 83558 transitions. [2025-04-13 18:21:31,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:31,595 INFO L278 IsEmpty]: Start isEmpty. Operand 20421 states and 83558 transitions. [2025-04-13 18:21:31,635 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:31,635 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:31,635 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, 1] [2025-04-13 18:21:31,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 18:21:31,636 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:31,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:31,636 INFO L85 PathProgramCache]: Analyzing trace with hash 665042509, now seen corresponding path program 16 times [2025-04-13 18:21:31,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:31,636 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439587917] [2025-04-13 18:21:31,636 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:31,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:31,642 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:31,648 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:31,648 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:21:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:31,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:31,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439587917] [2025-04-13 18:21:31,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439587917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:31,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:31,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:21:31,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819330031] [2025-04-13 18:21:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:31,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 18:21:31,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:31,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 18:21:31,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:21:31,828 INFO L87 Difference]: Start difference. First operand 20421 states and 83558 transitions. Second operand has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:33,615 INFO L93 Difference]: Finished difference Result 48309 states and 209056 transitions. [2025-04-13 18:21:33,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:21:33,615 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:33,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:33,919 INFO L225 Difference]: With dead ends: 48309 [2025-04-13 18:21:33,919 INFO L226 Difference]: Without dead ends: 43373 [2025-04-13 18:21:33,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 18:21:33,947 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 720 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:33,947 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 539 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:21:33,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43373 states. [2025-04-13 18:21:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43373 to 22825. [2025-04-13 18:21:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22825 states, 22824 states have (on average 4.082018927444795) internal successors, (93168), 22824 states have internal predecessors, (93168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22825 states to 22825 states and 93168 transitions. [2025-04-13 18:21:34,787 INFO L79 Accepts]: Start accepts. Automaton has 22825 states and 93168 transitions. Word has length 45 [2025-04-13 18:21:34,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:34,787 INFO L485 AbstractCegarLoop]: Abstraction has 22825 states and 93168 transitions. [2025-04-13 18:21:34,787 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.75) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:34,787 INFO L278 IsEmpty]: Start isEmpty. Operand 22825 states and 93168 transitions. [2025-04-13 18:21:34,839 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:34,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:34,840 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, 1] [2025-04-13 18:21:34,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 18:21:34,840 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:34,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1276437685, now seen corresponding path program 17 times [2025-04-13 18:21:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:34,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202328896] [2025-04-13 18:21:34,840 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:34,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:34,845 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:34,848 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:34,848 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:34,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:35,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202328896] [2025-04-13 18:21:35,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202328896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:35,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:35,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988513900] [2025-04-13 18:21:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:35,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:35,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:35,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:35,045 INFO L87 Difference]: Start difference. First operand 22825 states and 93168 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:36,976 INFO L93 Difference]: Finished difference Result 48212 states and 207928 transitions. [2025-04-13 18:21:36,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 18:21:36,976 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:36,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:37,273 INFO L225 Difference]: With dead ends: 48212 [2025-04-13 18:21:37,273 INFO L226 Difference]: Without dead ends: 44297 [2025-04-13 18:21:37,301 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=488, Invalid=2482, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 18:21:37,301 INFO L437 NwaCegarLoop]: 70 mSDtfsCounter, 819 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 2998 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:37,302 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 600 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2998 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:21:37,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44297 states. [2025-04-13 18:21:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44297 to 22835. [2025-04-13 18:21:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22835 states, 22834 states have (on average 4.081764036086538) internal successors, (93203), 22834 states have internal predecessors, (93203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22835 states to 22835 states and 93203 transitions. [2025-04-13 18:21:38,157 INFO L79 Accepts]: Start accepts. Automaton has 22835 states and 93203 transitions. Word has length 45 [2025-04-13 18:21:38,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:38,158 INFO L485 AbstractCegarLoop]: Abstraction has 22835 states and 93203 transitions. [2025-04-13 18:21:38,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:38,158 INFO L278 IsEmpty]: Start isEmpty. Operand 22835 states and 93203 transitions. [2025-04-13 18:21:38,203 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:38,203 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:38,203 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, 1] [2025-04-13 18:21:38,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 18:21:38,203 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:38,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:38,204 INFO L85 PathProgramCache]: Analyzing trace with hash -557096519, now seen corresponding path program 18 times [2025-04-13 18:21:38,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:38,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231592729] [2025-04-13 18:21:38,204 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:38,208 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:38,211 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:38,211 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:38,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:38,359 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231592729] [2025-04-13 18:21:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231592729] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:38,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:38,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 18:21:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369024006] [2025-04-13 18:21:38,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:38,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:21:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:38,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:21:38,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:21:38,360 INFO L87 Difference]: Start difference. First operand 22835 states and 93203 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:39,926 INFO L93 Difference]: Finished difference Result 45137 states and 193745 transitions. [2025-04-13 18:21:39,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 18:21:39,926 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:39,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:40,184 INFO L225 Difference]: With dead ends: 45137 [2025-04-13 18:21:40,185 INFO L226 Difference]: Without dead ends: 41228 [2025-04-13 18:21:40,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=358, Invalid=1804, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:21:40,203 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 737 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:40,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 540 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 18:21:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41228 states. [2025-04-13 18:21:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41228 to 20955. [2025-04-13 18:21:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20955 states, 20954 states have (on average 4.088861315262003) internal successors, (85678), 20954 states have internal predecessors, (85678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20955 states to 20955 states and 85678 transitions. [2025-04-13 18:21:41,134 INFO L79 Accepts]: Start accepts. Automaton has 20955 states and 85678 transitions. Word has length 45 [2025-04-13 18:21:41,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:41,134 INFO L485 AbstractCegarLoop]: Abstraction has 20955 states and 85678 transitions. [2025-04-13 18:21:41,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:41,135 INFO L278 IsEmpty]: Start isEmpty. Operand 20955 states and 85678 transitions. [2025-04-13 18:21:41,179 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:41,179 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:41,179 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, 1] [2025-04-13 18:21:41,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 18:21:41,180 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:41,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2124042034, now seen corresponding path program 1 times [2025-04-13 18:21:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:41,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553399354] [2025-04-13 18:21:41,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:21:41,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:41,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:41,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:41,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:41,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:41,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553399354] [2025-04-13 18:21:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553399354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863457706] [2025-04-13 18:21:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:41,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:41,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:41,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:41,279 INFO L87 Difference]: Start difference. First operand 20955 states and 85678 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:42,232 INFO L93 Difference]: Finished difference Result 31755 states and 130976 transitions. [2025-04-13 18:21:42,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:21:42,232 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:42,233 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:42,433 INFO L225 Difference]: With dead ends: 31755 [2025-04-13 18:21:42,433 INFO L226 Difference]: Without dead ends: 29378 [2025-04-13 18:21:42,449 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:21:42,449 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 454 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1591 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:42,449 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 189 Invalid, 1594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1591 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29378 states. [2025-04-13 18:21:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29378 to 23809. [2025-04-13 18:21:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23809 states, 23808 states have (on average 4.098244287634409) internal successors, (97571), 23808 states have internal predecessors, (97571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23809 states to 23809 states and 97571 transitions. [2025-04-13 18:21:43,216 INFO L79 Accepts]: Start accepts. Automaton has 23809 states and 97571 transitions. Word has length 45 [2025-04-13 18:21:43,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:43,216 INFO L485 AbstractCegarLoop]: Abstraction has 23809 states and 97571 transitions. [2025-04-13 18:21:43,216 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:43,216 INFO L278 IsEmpty]: Start isEmpty. Operand 23809 states and 97571 transitions. [2025-04-13 18:21:43,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:43,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:43,269 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, 1] [2025-04-13 18:21:43,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 18:21:43,269 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:43,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1148680540, now seen corresponding path program 2 times [2025-04-13 18:21:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:43,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395018264] [2025-04-13 18:21:43,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:21:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:43,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:43,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:43,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:21:43,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:43,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395018264] [2025-04-13 18:21:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395018264] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:43,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:43,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:43,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378713147] [2025-04-13 18:21:43,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:43,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:43,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:43,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:43,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:43,494 INFO L87 Difference]: Start difference. First operand 23809 states and 97571 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:44,430 INFO L93 Difference]: Finished difference Result 34703 states and 143490 transitions. [2025-04-13 18:21:44,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 18:21:44,430 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:44,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:44,652 INFO L225 Difference]: With dead ends: 34703 [2025-04-13 18:21:44,652 INFO L226 Difference]: Without dead ends: 31748 [2025-04-13 18:21:44,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=707, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:21:44,669 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 382 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:44,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 191 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31748 states. [2025-04-13 18:21:45,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31748 to 24411. [2025-04-13 18:21:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24411 states, 24410 states have (on average 4.103932814420319) internal successors, (100177), 24410 states have internal predecessors, (100177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24411 states to 24411 states and 100177 transitions. [2025-04-13 18:21:45,555 INFO L79 Accepts]: Start accepts. Automaton has 24411 states and 100177 transitions. Word has length 45 [2025-04-13 18:21:45,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:45,555 INFO L485 AbstractCegarLoop]: Abstraction has 24411 states and 100177 transitions. [2025-04-13 18:21:45,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:45,555 INFO L278 IsEmpty]: Start isEmpty. Operand 24411 states and 100177 transitions. [2025-04-13 18:21:45,607 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:45,607 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:45,607 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, 1] [2025-04-13 18:21:45,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 18:21:45,608 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:45,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash 351625755, now seen corresponding path program 19 times [2025-04-13 18:21:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:45,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454968300] [2025-04-13 18:21:45,608 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:21:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:45,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:21:45,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:45,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:21:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:45,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454968300] [2025-04-13 18:21:45,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454968300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:45,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:45,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:45,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132262322] [2025-04-13 18:21:45,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:45,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:45,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:45,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:45,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:45,698 INFO L87 Difference]: Start difference. First operand 24411 states and 100177 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:46,880 INFO L93 Difference]: Finished difference Result 38443 states and 161037 transitions. [2025-04-13 18:21:46,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 18:21:46,880 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:46,881 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:47,082 INFO L225 Difference]: With dead ends: 38443 [2025-04-13 18:21:47,082 INFO L226 Difference]: Without dead ends: 33687 [2025-04-13 18:21:47,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=1569, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 18:21:47,101 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 630 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:47,101 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 192 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33687 states. [2025-04-13 18:21:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33687 to 26865. [2025-04-13 18:21:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26865 states, 26864 states have (on average 4.109737939249554) internal successors, (110404), 26864 states have internal predecessors, (110404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26865 states to 26865 states and 110404 transitions. [2025-04-13 18:21:47,929 INFO L79 Accepts]: Start accepts. Automaton has 26865 states and 110404 transitions. Word has length 45 [2025-04-13 18:21:47,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:47,929 INFO L485 AbstractCegarLoop]: Abstraction has 26865 states and 110404 transitions. [2025-04-13 18:21:47,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:47,930 INFO L278 IsEmpty]: Start isEmpty. Operand 26865 states and 110404 transitions. [2025-04-13 18:21:47,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:47,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:47,992 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, 1] [2025-04-13 18:21:47,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 18:21:47,992 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:47,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:47,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1942518848, now seen corresponding path program 3 times [2025-04-13 18:21:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:47,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766617564] [2025-04-13 18:21:47,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:21:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:47,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:48,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:48,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:21:48,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:48,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:48,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766617564] [2025-04-13 18:21:48,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766617564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:48,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:48,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:48,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538429143] [2025-04-13 18:21:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:48,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:48,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:48,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:48,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:48,108 INFO L87 Difference]: Start difference. First operand 26865 states and 110404 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:49,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:49,409 INFO L93 Difference]: Finished difference Result 37069 states and 154880 transitions. [2025-04-13 18:21:49,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:21:49,409 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:49,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:49,636 INFO L225 Difference]: With dead ends: 37069 [2025-04-13 18:21:49,637 INFO L226 Difference]: Without dead ends: 34767 [2025-04-13 18:21:49,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:21:49,657 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 431 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:49,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 208 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 18:21:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2025-04-13 18:21:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 26819. [2025-04-13 18:21:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26819 states, 26818 states have (on average 4.110410918040122) internal successors, (110233), 26818 states have internal predecessors, (110233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26819 states to 26819 states and 110233 transitions. [2025-04-13 18:21:50,645 INFO L79 Accepts]: Start accepts. Automaton has 26819 states and 110233 transitions. Word has length 45 [2025-04-13 18:21:50,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:50,645 INFO L485 AbstractCegarLoop]: Abstraction has 26819 states and 110233 transitions. [2025-04-13 18:21:50,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:50,646 INFO L278 IsEmpty]: Start isEmpty. Operand 26819 states and 110233 transitions. [2025-04-13 18:21:50,709 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:50,709 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:50,709 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, 1] [2025-04-13 18:21:50,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 18:21:50,709 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:50,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1224446796, now seen corresponding path program 4 times [2025-04-13 18:21:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:50,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445443247] [2025-04-13 18:21:50,710 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:21:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:50,714 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:50,716 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 18:21:50,716 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:21:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:50,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445443247] [2025-04-13 18:21:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445443247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 18:21:50,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465683457] [2025-04-13 18:21:50,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:50,795 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:21:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:50,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:21:50,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:21:50,796 INFO L87 Difference]: Start difference. First operand 26819 states and 110233 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:52,084 INFO L93 Difference]: Finished difference Result 60621 states and 258206 transitions. [2025-04-13 18:21:52,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:21:52,085 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:52,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:52,461 INFO L225 Difference]: With dead ends: 60621 [2025-04-13 18:21:52,461 INFO L226 Difference]: Without dead ends: 53295 [2025-04-13 18:21:52,497 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:21:52,497 INFO L437 NwaCegarLoop]: 72 mSDtfsCounter, 336 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:52,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 405 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:21:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53295 states. [2025-04-13 18:21:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53295 to 30526. [2025-04-13 18:21:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30526 states, 30525 states have (on average 4.097461097461098) internal successors, (125075), 30525 states have internal predecessors, (125075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30526 states to 30526 states and 125075 transitions. [2025-04-13 18:21:53,760 INFO L79 Accepts]: Start accepts. Automaton has 30526 states and 125075 transitions. Word has length 45 [2025-04-13 18:21:53,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:53,760 INFO L485 AbstractCegarLoop]: Abstraction has 30526 states and 125075 transitions. [2025-04-13 18:21:53,760 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:53,760 INFO L278 IsEmpty]: Start isEmpty. Operand 30526 states and 125075 transitions. [2025-04-13 18:21:53,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:53,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:53,846 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, 1] [2025-04-13 18:21:53,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 18:21:53,846 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:53,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 30027260, now seen corresponding path program 5 times [2025-04-13 18:21:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:53,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593380448] [2025-04-13 18:21:53,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:21:53,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:53,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:53,856 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:21:53,856 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:21:53,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:53,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593380448] [2025-04-13 18:21:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593380448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:53,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136987794] [2025-04-13 18:21:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:53,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:53,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:53,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:53,981 INFO L87 Difference]: Start difference. First operand 30526 states and 125075 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:55,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:55,553 INFO L93 Difference]: Finished difference Result 62041 states and 261501 transitions. [2025-04-13 18:21:55,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:21:55,553 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:55,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:55,882 INFO L225 Difference]: With dead ends: 62041 [2025-04-13 18:21:55,882 INFO L226 Difference]: Without dead ends: 57498 [2025-04-13 18:21:55,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1343, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 18:21:55,916 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 511 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1757 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:55,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 216 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:21:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57498 states. [2025-04-13 18:21:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57498 to 31416. [2025-04-13 18:21:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31416 states, 31415 states have (on average 4.094222505172688) internal successors, (128620), 31415 states have internal predecessors, (128620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 128620 transitions. [2025-04-13 18:21:57,196 INFO L79 Accepts]: Start accepts. Automaton has 31416 states and 128620 transitions. Word has length 45 [2025-04-13 18:21:57,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:21:57,196 INFO L485 AbstractCegarLoop]: Abstraction has 31416 states and 128620 transitions. [2025-04-13 18:21:57,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:57,196 INFO L278 IsEmpty]: Start isEmpty. Operand 31416 states and 128620 transitions. [2025-04-13 18:21:57,266 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:21:57,266 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:21:57,266 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, 1] [2025-04-13 18:21:57,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 18:21:57,266 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:21:57,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:21:57,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1410034124, now seen corresponding path program 6 times [2025-04-13 18:21:57,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:21:57,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732634570] [2025-04-13 18:21:57,267 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:21:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:21:57,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:21:57,273 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:21:57,273 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:21:57,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:21:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:21:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:21:57,381 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732634570] [2025-04-13 18:21:57,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732634570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:21:57,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:21:57,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:21:57,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889183527] [2025-04-13 18:21:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:21:57,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:21:57,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:21:57,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:21:57,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:21:57,382 INFO L87 Difference]: Start difference. First operand 31416 states and 128620 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:21:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:21:58,699 INFO L93 Difference]: Finished difference Result 48190 states and 203487 transitions. [2025-04-13 18:21:58,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:21:58,702 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:21:58,702 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:21:59,031 INFO L225 Difference]: With dead ends: 48190 [2025-04-13 18:21:59,031 INFO L226 Difference]: Without dead ends: 45299 [2025-04-13 18:21:59,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:21:59,053 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 420 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:21:59,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 232 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:21:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45299 states. [2025-04-13 18:21:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45299 to 31420. [2025-04-13 18:21:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31420 states, 31419 states have (on average 4.090072885833413) internal successors, (128506), 31419 states have internal predecessors, (128506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31420 states to 31420 states and 128506 transitions. [2025-04-13 18:22:00,470 INFO L79 Accepts]: Start accepts. Automaton has 31420 states and 128506 transitions. Word has length 45 [2025-04-13 18:22:00,471 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:00,471 INFO L485 AbstractCegarLoop]: Abstraction has 31420 states and 128506 transitions. [2025-04-13 18:22:00,471 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:00,471 INFO L278 IsEmpty]: Start isEmpty. Operand 31420 states and 128506 transitions. [2025-04-13 18:22:00,547 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:00,547 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, 1] [2025-04-13 18:22:00,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 18:22:00,548 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:00,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1433453905, now seen corresponding path program 20 times [2025-04-13 18:22:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:00,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900727076] [2025-04-13 18:22:00,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:00,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:00,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:00,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:00,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900727076] [2025-04-13 18:22:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900727076] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:00,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899563475] [2025-04-13 18:22:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:00,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:00,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:00,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:00,642 INFO L87 Difference]: Start difference. First operand 31420 states and 128506 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:01,823 INFO L93 Difference]: Finished difference Result 45577 states and 188832 transitions. [2025-04-13 18:22:01,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:22:01,823 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:01,823 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:02,081 INFO L225 Difference]: With dead ends: 45577 [2025-04-13 18:22:02,081 INFO L226 Difference]: Without dead ends: 41371 [2025-04-13 18:22:02,102 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:22:02,103 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 466 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:02,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 188 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41371 states. [2025-04-13 18:22:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41371 to 34626. [2025-04-13 18:22:03,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34626 states, 34625 states have (on average 4.1010252707581225) internal successors, (141998), 34625 states have internal predecessors, (141998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34626 states to 34626 states and 141998 transitions. [2025-04-13 18:22:03,530 INFO L79 Accepts]: Start accepts. Automaton has 34626 states and 141998 transitions. Word has length 45 [2025-04-13 18:22:03,530 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:03,530 INFO L485 AbstractCegarLoop]: Abstraction has 34626 states and 141998 transitions. [2025-04-13 18:22:03,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:03,531 INFO L278 IsEmpty]: Start isEmpty. Operand 34626 states and 141998 transitions. [2025-04-13 18:22:03,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:03,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:03,605 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, 1] [2025-04-13 18:22:03,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 18:22:03,605 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:03,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 711265335, now seen corresponding path program 21 times [2025-04-13 18:22:03,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:03,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585726533] [2025-04-13 18:22:03,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:03,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:03,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:03,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:03,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:03,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:03,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:03,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585726533] [2025-04-13 18:22:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585726533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713732961] [2025-04-13 18:22:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:03,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:03,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:03,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:03,721 INFO L87 Difference]: Start difference. First operand 34626 states and 141998 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:04,758 INFO L93 Difference]: Finished difference Result 48483 states and 201184 transitions. [2025-04-13 18:22:04,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:22:04,759 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:04,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:05,037 INFO L225 Difference]: With dead ends: 48483 [2025-04-13 18:22:05,038 INFO L226 Difference]: Without dead ends: 44277 [2025-04-13 18:22:05,063 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:22:05,063 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 507 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:05,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 168 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44277 states. [2025-04-13 18:22:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44277 to 34976. [2025-04-13 18:22:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34976 states, 34975 states have (on average 4.098441744102931) internal successors, (143343), 34975 states have internal predecessors, (143343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:06,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34976 states to 34976 states and 143343 transitions. [2025-04-13 18:22:06,299 INFO L79 Accepts]: Start accepts. Automaton has 34976 states and 143343 transitions. Word has length 45 [2025-04-13 18:22:06,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:06,300 INFO L485 AbstractCegarLoop]: Abstraction has 34976 states and 143343 transitions. [2025-04-13 18:22:06,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:06,300 INFO L278 IsEmpty]: Start isEmpty. Operand 34976 states and 143343 transitions. [2025-04-13 18:22:06,396 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:06,396 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:06,397 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, 1] [2025-04-13 18:22:06,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 18:22:06,397 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:06,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2112806373, now seen corresponding path program 22 times [2025-04-13 18:22:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:06,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878501438] [2025-04-13 18:22:06,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:06,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:06,403 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:06,407 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:06,407 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:06,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878501438] [2025-04-13 18:22:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878501438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:06,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:22:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583835804] [2025-04-13 18:22:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:06,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:22:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:06,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:22:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:06,670 INFO L87 Difference]: Start difference. First operand 34976 states and 143343 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:08,329 INFO L93 Difference]: Finished difference Result 52242 states and 221852 transitions. [2025-04-13 18:22:08,329 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:22:08,329 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:08,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:08,643 INFO L225 Difference]: With dead ends: 52242 [2025-04-13 18:22:08,643 INFO L226 Difference]: Without dead ends: 49703 [2025-04-13 18:22:08,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1295, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:22:08,659 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 439 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:08,659 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 330 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 18:22:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49703 states. [2025-04-13 18:22:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49703 to 35188. [2025-04-13 18:22:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35188 states, 35187 states have (on average 4.097479182652684) internal successors, (144178), 35187 states have internal predecessors, (144178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35188 states to 35188 states and 144178 transitions. [2025-04-13 18:22:09,691 INFO L79 Accepts]: Start accepts. Automaton has 35188 states and 144178 transitions. Word has length 45 [2025-04-13 18:22:09,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:09,691 INFO L485 AbstractCegarLoop]: Abstraction has 35188 states and 144178 transitions. [2025-04-13 18:22:09,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:09,691 INFO L278 IsEmpty]: Start isEmpty. Operand 35188 states and 144178 transitions. [2025-04-13 18:22:09,765 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:09,765 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:09,765 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, 1] [2025-04-13 18:22:09,765 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 18:22:09,765 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:09,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1379958949, now seen corresponding path program 23 times [2025-04-13 18:22:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:09,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171040888] [2025-04-13 18:22:09,766 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:09,770 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:09,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:09,773 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:10,055 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171040888] [2025-04-13 18:22:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171040888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391636863] [2025-04-13 18:22:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:10,056 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:10,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:10,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:10,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:10,056 INFO L87 Difference]: Start difference. First operand 35188 states and 144178 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:11,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:11,561 INFO L93 Difference]: Finished difference Result 52288 states and 218056 transitions. [2025-04-13 18:22:11,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 18:22:11,561 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:11,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:11,863 INFO L225 Difference]: With dead ends: 52288 [2025-04-13 18:22:11,863 INFO L226 Difference]: Without dead ends: 48082 [2025-04-13 18:22:11,882 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:22:11,882 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 438 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1869 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:11,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 194 Invalid, 1876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1869 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:11,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48082 states. [2025-04-13 18:22:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48082 to 35254. [2025-04-13 18:22:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35254 states, 35253 states have (on average 4.096786089127167) internal successors, (144424), 35253 states have internal predecessors, (144424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35254 states to 35254 states and 144424 transitions. [2025-04-13 18:22:12,933 INFO L79 Accepts]: Start accepts. Automaton has 35254 states and 144424 transitions. Word has length 45 [2025-04-13 18:22:12,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:12,934 INFO L485 AbstractCegarLoop]: Abstraction has 35254 states and 144424 transitions. [2025-04-13 18:22:12,934 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:12,934 INFO L278 IsEmpty]: Start isEmpty. Operand 35254 states and 144424 transitions. [2025-04-13 18:22:13,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:13,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:13,010 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, 1] [2025-04-13 18:22:13,010 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 18:22:13,010 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:13,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1276891567, now seen corresponding path program 24 times [2025-04-13 18:22:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:13,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36137260] [2025-04-13 18:22:13,011 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:13,015 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:13,017 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:13,018 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:13,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36137260] [2025-04-13 18:22:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36137260] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:13,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273534463] [2025-04-13 18:22:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:13,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:13,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:13,329 INFO L87 Difference]: Start difference. First operand 35254 states and 144424 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:14,241 INFO L93 Difference]: Finished difference Result 40681 states and 169091 transitions. [2025-04-13 18:22:14,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:14,241 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:14,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:14,687 INFO L225 Difference]: With dead ends: 40681 [2025-04-13 18:22:14,687 INFO L226 Difference]: Without dead ends: 37836 [2025-04-13 18:22:14,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:22:14,701 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 309 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:14,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 169 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37836 states. [2025-04-13 18:22:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37836 to 35566. [2025-04-13 18:22:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35566 states, 35565 states have (on average 4.096893012793477) internal successors, (145706), 35565 states have internal predecessors, (145706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35566 states to 35566 states and 145706 transitions. [2025-04-13 18:22:15,799 INFO L79 Accepts]: Start accepts. Automaton has 35566 states and 145706 transitions. Word has length 45 [2025-04-13 18:22:15,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:15,799 INFO L485 AbstractCegarLoop]: Abstraction has 35566 states and 145706 transitions. [2025-04-13 18:22:15,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:15,799 INFO L278 IsEmpty]: Start isEmpty. Operand 35566 states and 145706 transitions. [2025-04-13 18:22:15,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:15,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:15,876 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, 1] [2025-04-13 18:22:15,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 18:22:15,876 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:15,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1423616336, now seen corresponding path program 7 times [2025-04-13 18:22:15,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:15,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014273873] [2025-04-13 18:22:15,877 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:15,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:15,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:15,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:15,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:15,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:15,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014273873] [2025-04-13 18:22:15,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014273873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:15,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431295662] [2025-04-13 18:22:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:15,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:15,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:15,994 INFO L87 Difference]: Start difference. First operand 35566 states and 145706 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:17,073 INFO L93 Difference]: Finished difference Result 46983 states and 193828 transitions. [2025-04-13 18:22:17,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:22:17,074 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:17,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:17,356 INFO L225 Difference]: With dead ends: 46983 [2025-04-13 18:22:17,357 INFO L226 Difference]: Without dead ends: 43708 [2025-04-13 18:22:17,382 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:22:17,382 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 340 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:17,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 165 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:17,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43708 states. [2025-04-13 18:22:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43708 to 36018. [2025-04-13 18:22:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36018 states, 36017 states have (on average 4.094621984063082) internal successors, (147476), 36017 states have internal predecessors, (147476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36018 states to 36018 states and 147476 transitions. [2025-04-13 18:22:18,633 INFO L79 Accepts]: Start accepts. Automaton has 36018 states and 147476 transitions. Word has length 45 [2025-04-13 18:22:18,633 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:18,633 INFO L485 AbstractCegarLoop]: Abstraction has 36018 states and 147476 transitions. [2025-04-13 18:22:18,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:18,633 INFO L278 IsEmpty]: Start isEmpty. Operand 36018 states and 147476 transitions. [2025-04-13 18:22:18,726 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:18,726 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:18,726 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, 1] [2025-04-13 18:22:18,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 18:22:18,726 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:18,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1470482882, now seen corresponding path program 8 times [2025-04-13 18:22:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:18,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015453659] [2025-04-13 18:22:18,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:18,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:18,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:18,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:18,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:18,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015453659] [2025-04-13 18:22:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015453659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989987992] [2025-04-13 18:22:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:18,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:18,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:18,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:18,817 INFO L87 Difference]: Start difference. First operand 36018 states and 147476 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:19,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:19,903 INFO L93 Difference]: Finished difference Result 48281 states and 199851 transitions. [2025-04-13 18:22:19,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:19,903 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:19,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:20,204 INFO L225 Difference]: With dead ends: 48281 [2025-04-13 18:22:20,204 INFO L226 Difference]: Without dead ends: 45587 [2025-04-13 18:22:20,228 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:20,228 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 386 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:20,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 186 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45587 states. [2025-04-13 18:22:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45587 to 35564. [2025-04-13 18:22:21,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35564 states, 35563 states have (on average 4.09608300762028) internal successors, (145669), 35563 states have internal predecessors, (145669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35564 states to 35564 states and 145669 transitions. [2025-04-13 18:22:21,445 INFO L79 Accepts]: Start accepts. Automaton has 35564 states and 145669 transitions. Word has length 45 [2025-04-13 18:22:21,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:21,445 INFO L485 AbstractCegarLoop]: Abstraction has 35564 states and 145669 transitions. [2025-04-13 18:22:21,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:21,445 INFO L278 IsEmpty]: Start isEmpty. Operand 35564 states and 145669 transitions. [2025-04-13 18:22:21,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:21,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:21,520 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, 1] [2025-04-13 18:22:21,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 18:22:21,520 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:21,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 739411536, now seen corresponding path program 9 times [2025-04-13 18:22:21,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:21,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46405836] [2025-04-13 18:22:21,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:21,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:21,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:21,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:21,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:21,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:21,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46405836] [2025-04-13 18:22:21,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46405836] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:21,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:21,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:21,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562441038] [2025-04-13 18:22:21,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:21,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:21,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:21,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:21,619 INFO L87 Difference]: Start difference. First operand 35564 states and 145669 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:22,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:22,779 INFO L93 Difference]: Finished difference Result 49799 states and 207980 transitions. [2025-04-13 18:22:22,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:22,779 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:22,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:23,120 INFO L225 Difference]: With dead ends: 49799 [2025-04-13 18:22:23,120 INFO L226 Difference]: Without dead ends: 47305 [2025-04-13 18:22:23,145 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:22:23,145 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 322 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:23,146 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 197 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:22:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47305 states. [2025-04-13 18:22:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47305 to 34962. [2025-04-13 18:22:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34962 states, 34961 states have (on average 4.099711106661709) internal successors, (143330), 34961 states have internal predecessors, (143330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34962 states to 34962 states and 143330 transitions. [2025-04-13 18:22:24,326 INFO L79 Accepts]: Start accepts. Automaton has 34962 states and 143330 transitions. Word has length 45 [2025-04-13 18:22:24,326 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:24,326 INFO L485 AbstractCegarLoop]: Abstraction has 34962 states and 143330 transitions. [2025-04-13 18:22:24,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:24,326 INFO L278 IsEmpty]: Start isEmpty. Operand 34962 states and 143330 transitions. [2025-04-13 18:22:24,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:24,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:24,399 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, 1] [2025-04-13 18:22:24,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 18:22:24,399 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:24,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1381302684, now seen corresponding path program 10 times [2025-04-13 18:22:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:24,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379724507] [2025-04-13 18:22:24,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:24,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:24,405 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 18:22:24,405 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:22:24,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:24,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379724507] [2025-04-13 18:22:24,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379724507] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:24,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:24,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 18:22:24,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393327528] [2025-04-13 18:22:24,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:24,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 18:22:24,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:24,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 18:22:24,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:22:24,500 INFO L87 Difference]: Start difference. First operand 34962 states and 143330 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:26,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:26,006 INFO L93 Difference]: Finished difference Result 92043 states and 403897 transitions. [2025-04-13 18:22:26,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:22:26,006 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:26,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:26,768 INFO L225 Difference]: With dead ends: 92043 [2025-04-13 18:22:26,768 INFO L226 Difference]: Without dead ends: 84492 [2025-04-13 18:22:26,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:22:26,803 INFO L437 NwaCegarLoop]: 55 mSDtfsCounter, 417 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 1886 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:26,803 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 338 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1886 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84492 states. [2025-04-13 18:22:28,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84492 to 36448. [2025-04-13 18:22:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36448 states, 36447 states have (on average 4.095590857958131) internal successors, (149272), 36447 states have internal predecessors, (149272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36448 states to 36448 states and 149272 transitions. [2025-04-13 18:22:28,477 INFO L79 Accepts]: Start accepts. Automaton has 36448 states and 149272 transitions. Word has length 45 [2025-04-13 18:22:28,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:28,477 INFO L485 AbstractCegarLoop]: Abstraction has 36448 states and 149272 transitions. [2025-04-13 18:22:28,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:28,477 INFO L278 IsEmpty]: Start isEmpty. Operand 36448 states and 149272 transitions. [2025-04-13 18:22:28,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:28,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:28,554 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, 1] [2025-04-13 18:22:28,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 18:22:28,555 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:28,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash -254270483, now seen corresponding path program 25 times [2025-04-13 18:22:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:28,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279272075] [2025-04-13 18:22:28,555 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:28,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:28,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:28,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:28,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:28,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:28,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:28,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:28,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279272075] [2025-04-13 18:22:28,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279272075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:28,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:28,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587837847] [2025-04-13 18:22:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:28,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:28,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:28,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:28,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:28,657 INFO L87 Difference]: Start difference. First operand 36448 states and 149272 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:29,775 INFO L93 Difference]: Finished difference Result 46985 states and 193448 transitions. [2025-04-13 18:22:29,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:22:29,775 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:29,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:30,075 INFO L225 Difference]: With dead ends: 46985 [2025-04-13 18:22:30,075 INFO L226 Difference]: Without dead ends: 43756 [2025-04-13 18:22:30,099 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:22:30,099 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 346 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:30,099 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 173 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43756 states. [2025-04-13 18:22:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43756 to 36780. [2025-04-13 18:22:31,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36780 states, 36779 states have (on average 4.100709644090378) internal successors, (150820), 36779 states have internal predecessors, (150820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36780 states to 36780 states and 150820 transitions. [2025-04-13 18:22:31,377 INFO L79 Accepts]: Start accepts. Automaton has 36780 states and 150820 transitions. Word has length 45 [2025-04-13 18:22:31,378 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:31,378 INFO L485 AbstractCegarLoop]: Abstraction has 36780 states and 150820 transitions. [2025-04-13 18:22:31,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:31,378 INFO L278 IsEmpty]: Start isEmpty. Operand 36780 states and 150820 transitions. [2025-04-13 18:22:31,456 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:31,456 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:31,456 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, 1] [2025-04-13 18:22:31,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 18:22:31,456 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:31,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:31,457 INFO L85 PathProgramCache]: Analyzing trace with hash 549095314, now seen corresponding path program 11 times [2025-04-13 18:22:31,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:31,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112275341] [2025-04-13 18:22:31,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:31,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:31,461 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:31,463 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:31,463 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:31,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:31,569 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112275341] [2025-04-13 18:22:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112275341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:31,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148281948] [2025-04-13 18:22:31,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:31,569 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:31,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:31,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:31,570 INFO L87 Difference]: Start difference. First operand 36780 states and 150820 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:32,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:32,690 INFO L93 Difference]: Finished difference Result 44114 states and 182038 transitions. [2025-04-13 18:22:32,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:22:32,690 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:32,690 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:32,985 INFO L225 Difference]: With dead ends: 44114 [2025-04-13 18:22:32,986 INFO L226 Difference]: Without dead ends: 41448 [2025-04-13 18:22:33,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=661, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:22:33,006 INFO L437 NwaCegarLoop]: 28 mSDtfsCounter, 382 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:33,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 172 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:33,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41448 states. [2025-04-13 18:22:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41448 to 33820. [2025-04-13 18:22:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33820 states, 33819 states have (on average 4.088648392915225) internal successors, (138274), 33819 states have internal predecessors, (138274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33820 states to 33820 states and 138274 transitions. [2025-04-13 18:22:33,959 INFO L79 Accepts]: Start accepts. Automaton has 33820 states and 138274 transitions. Word has length 45 [2025-04-13 18:22:33,959 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:33,959 INFO L485 AbstractCegarLoop]: Abstraction has 33820 states and 138274 transitions. [2025-04-13 18:22:33,959 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:33,959 INFO L278 IsEmpty]: Start isEmpty. Operand 33820 states and 138274 transitions. [2025-04-13 18:22:34,029 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:34,029 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:34,029 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, 1] [2025-04-13 18:22:34,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 18:22:34,029 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:34,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -717979945, now seen corresponding path program 26 times [2025-04-13 18:22:34,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:34,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871095050] [2025-04-13 18:22:34,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:34,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:34,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:34,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:34,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:34,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:34,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871095050] [2025-04-13 18:22:34,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871095050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:34,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:34,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:34,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315758576] [2025-04-13 18:22:34,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:34,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:34,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:34,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:34,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:34,352 INFO L87 Difference]: Start difference. First operand 33820 states and 138274 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:35,489 INFO L93 Difference]: Finished difference Result 47845 states and 197890 transitions. [2025-04-13 18:22:35,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:22:35,489 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:35,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:35,785 INFO L225 Difference]: With dead ends: 47845 [2025-04-13 18:22:35,786 INFO L226 Difference]: Without dead ends: 43639 [2025-04-13 18:22:35,802 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2025-04-13 18:22:35,802 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 449 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 1637 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:35,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 194 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43639 states. [2025-04-13 18:22:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43639 to 36752. [2025-04-13 18:22:36,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36752 states, 36751 states have (on average 4.101085684743272) internal successors, (150719), 36751 states have internal predecessors, (150719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36752 states to 36752 states and 150719 transitions. [2025-04-13 18:22:36,873 INFO L79 Accepts]: Start accepts. Automaton has 36752 states and 150719 transitions. Word has length 45 [2025-04-13 18:22:36,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:36,874 INFO L485 AbstractCegarLoop]: Abstraction has 36752 states and 150719 transitions. [2025-04-13 18:22:36,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:36,874 INFO L278 IsEmpty]: Start isEmpty. Operand 36752 states and 150719 transitions. [2025-04-13 18:22:36,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:36,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:36,951 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, 1] [2025-04-13 18:22:36,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 18:22:36,952 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:36,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash 155343957, now seen corresponding path program 27 times [2025-04-13 18:22:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:36,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010777191] [2025-04-13 18:22:36,952 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:22:36,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:36,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:36,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:36,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:22:36,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:37,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:37,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010777191] [2025-04-13 18:22:37,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010777191] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:37,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:37,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:37,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551661885] [2025-04-13 18:22:37,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:37,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:37,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:37,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:37,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:37,049 INFO L87 Difference]: Start difference. First operand 36752 states and 150719 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:38,268 INFO L93 Difference]: Finished difference Result 51291 states and 212307 transitions. [2025-04-13 18:22:38,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:22:38,268 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:38,268 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:38,763 INFO L225 Difference]: With dead ends: 51291 [2025-04-13 18:22:38,763 INFO L226 Difference]: Without dead ends: 47085 [2025-04-13 18:22:38,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:22:38,777 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 428 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:38,778 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 201 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:38,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47085 states. [2025-04-13 18:22:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47085 to 37516. [2025-04-13 18:22:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37516 states, 37515 states have (on average 4.095934959349593) internal successors, (153659), 37515 states have internal predecessors, (153659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:39,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37516 states to 37516 states and 153659 transitions. [2025-04-13 18:22:39,863 INFO L79 Accepts]: Start accepts. Automaton has 37516 states and 153659 transitions. Word has length 45 [2025-04-13 18:22:39,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:39,863 INFO L485 AbstractCegarLoop]: Abstraction has 37516 states and 153659 transitions. [2025-04-13 18:22:39,863 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:39,863 INFO L278 IsEmpty]: Start isEmpty. Operand 37516 states and 153659 transitions. [2025-04-13 18:22:39,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:39,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:39,945 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, 1] [2025-04-13 18:22:39,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 18:22:39,945 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:39,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:39,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2011146447, now seen corresponding path program 28 times [2025-04-13 18:22:39,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:39,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962332495] [2025-04-13 18:22:39,945 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:22:39,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:39,949 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:39,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:39,953 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:22:39,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:40,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962332495] [2025-04-13 18:22:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962332495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:22:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309059618] [2025-04-13 18:22:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:40,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:22:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:40,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:22:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:22:40,130 INFO L87 Difference]: Start difference. First operand 37516 states and 153659 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:41,708 INFO L93 Difference]: Finished difference Result 54477 states and 231438 transitions. [2025-04-13 18:22:41,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:22:41,708 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:41,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:42,255 INFO L225 Difference]: With dead ends: 54477 [2025-04-13 18:22:42,256 INFO L226 Difference]: Without dead ends: 51938 [2025-04-13 18:22:42,273 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=1295, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:22:42,273 INFO L437 NwaCegarLoop]: 43 mSDtfsCounter, 433 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:42,273 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 350 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51938 states. [2025-04-13 18:22:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51938 to 37616. [2025-04-13 18:22:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37616 states, 37615 states have (on average 4.0950152864548715) internal successors, (154034), 37615 states have internal predecessors, (154034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37616 states to 37616 states and 154034 transitions. [2025-04-13 18:22:43,584 INFO L79 Accepts]: Start accepts. Automaton has 37616 states and 154034 transitions. Word has length 45 [2025-04-13 18:22:43,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:43,584 INFO L485 AbstractCegarLoop]: Abstraction has 37616 states and 154034 transitions. [2025-04-13 18:22:43,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:43,584 INFO L278 IsEmpty]: Start isEmpty. Operand 37616 states and 154034 transitions. [2025-04-13 18:22:43,669 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:43,669 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:43,669 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, 1] [2025-04-13 18:22:43,669 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 18:22:43,670 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:43,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash 338705077, now seen corresponding path program 29 times [2025-04-13 18:22:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:43,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411223923] [2025-04-13 18:22:43,670 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:22:43,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:43,676 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:43,680 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:43,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:22:43,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:43,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:43,784 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411223923] [2025-04-13 18:22:43,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411223923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:43,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:43,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:43,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27640577] [2025-04-13 18:22:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:43,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:43,784 INFO L87 Difference]: Start difference. First operand 37616 states and 154034 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:45,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:45,035 INFO L93 Difference]: Finished difference Result 54984 states and 228719 transitions. [2025-04-13 18:22:45,035 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 18:22:45,035 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:45,035 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:45,395 INFO L225 Difference]: With dead ends: 54984 [2025-04-13 18:22:45,395 INFO L226 Difference]: Without dead ends: 50778 [2025-04-13 18:22:45,426 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:22:45,426 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 417 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 1853 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:45,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 217 Invalid, 1858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1853 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50778 states. [2025-04-13 18:22:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50778 to 37682. [2025-04-13 18:22:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37682 states, 37681 states have (on average 4.094371168493405) internal successors, (154280), 37681 states have internal predecessors, (154280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37682 states to 37682 states and 154280 transitions. [2025-04-13 18:22:46,741 INFO L79 Accepts]: Start accepts. Automaton has 37682 states and 154280 transitions. Word has length 45 [2025-04-13 18:22:46,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:46,741 INFO L485 AbstractCegarLoop]: Abstraction has 37682 states and 154280 transitions. [2025-04-13 18:22:46,741 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:46,741 INFO L278 IsEmpty]: Start isEmpty. Operand 37682 states and 154280 transitions. [2025-04-13 18:22:46,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:46,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:46,820 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, 1] [2025-04-13 18:22:46,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 18:22:46,820 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:46,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1590314227, now seen corresponding path program 30 times [2025-04-13 18:22:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:46,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960742814] [2025-04-13 18:22:46,821 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:46,825 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:46,828 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:46,828 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:46,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960742814] [2025-04-13 18:22:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960742814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:46,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643980814] [2025-04-13 18:22:46,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:46,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:46,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:46,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:46,907 INFO L87 Difference]: Start difference. First operand 37682 states and 154280 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:48,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:48,050 INFO L93 Difference]: Finished difference Result 42354 states and 175554 transitions. [2025-04-13 18:22:48,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 18:22:48,051 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:48,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:48,361 INFO L225 Difference]: With dead ends: 42354 [2025-04-13 18:22:48,361 INFO L226 Difference]: Without dead ends: 39812 [2025-04-13 18:22:48,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:22:48,384 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 253 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:48,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 187 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39812 states. [2025-04-13 18:22:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39812 to 37958. [2025-04-13 18:22:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37958 states, 37957 states have (on average 4.092683826435176) internal successors, (155346), 37957 states have internal predecessors, (155346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37958 states to 37958 states and 155346 transitions. [2025-04-13 18:22:49,715 INFO L79 Accepts]: Start accepts. Automaton has 37958 states and 155346 transitions. Word has length 45 [2025-04-13 18:22:49,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:49,716 INFO L485 AbstractCegarLoop]: Abstraction has 37958 states and 155346 transitions. [2025-04-13 18:22:49,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:49,716 INFO L278 IsEmpty]: Start isEmpty. Operand 37958 states and 155346 transitions. [2025-04-13 18:22:49,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:49,806 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:49,806 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, 1] [2025-04-13 18:22:49,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 18:22:49,806 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:49,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -861005100, now seen corresponding path program 12 times [2025-04-13 18:22:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:49,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539839283] [2025-04-13 18:22:49,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:22:49,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:49,811 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:49,813 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:49,813 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:22:49,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:49,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:49,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539839283] [2025-04-13 18:22:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539839283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:49,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:49,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221918618] [2025-04-13 18:22:49,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:49,917 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:49,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:49,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:49,917 INFO L87 Difference]: Start difference. First operand 37958 states and 155346 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:51,146 INFO L93 Difference]: Finished difference Result 49548 states and 203820 transitions. [2025-04-13 18:22:51,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 18:22:51,146 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:51,146 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:51,518 INFO L225 Difference]: With dead ends: 49548 [2025-04-13 18:22:51,518 INFO L226 Difference]: Without dead ends: 46907 [2025-04-13 18:22:51,546 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=865, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:22:51,547 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 428 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:51,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 205 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:22:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46907 states. [2025-04-13 18:22:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46907 to 37958. [2025-04-13 18:22:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37958 states, 37957 states have (on average 4.092683826435176) internal successors, (155346), 37957 states have internal predecessors, (155346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37958 states to 37958 states and 155346 transitions. [2025-04-13 18:22:52,911 INFO L79 Accepts]: Start accepts. Automaton has 37958 states and 155346 transitions. Word has length 45 [2025-04-13 18:22:52,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:52,911 INFO L485 AbstractCegarLoop]: Abstraction has 37958 states and 155346 transitions. [2025-04-13 18:22:52,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:52,911 INFO L278 IsEmpty]: Start isEmpty. Operand 37958 states and 155346 transitions. [2025-04-13 18:22:52,997 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:52,997 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:52,997 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, 1] [2025-04-13 18:22:52,997 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 18:22:52,998 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:52,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:52,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2012107016, now seen corresponding path program 13 times [2025-04-13 18:22:52,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:52,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960190605] [2025-04-13 18:22:52,998 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:52,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:53,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:53,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:53,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:53,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:53,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:53,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960190605] [2025-04-13 18:22:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960190605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70020330] [2025-04-13 18:22:53,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:53,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:53,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:53,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:53,114 INFO L87 Difference]: Start difference. First operand 37958 states and 155346 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:54,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:54,275 INFO L93 Difference]: Finished difference Result 53702 states and 221148 transitions. [2025-04-13 18:22:54,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 18:22:54,275 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:54,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:54,645 INFO L225 Difference]: With dead ends: 53702 [2025-04-13 18:22:54,645 INFO L226 Difference]: Without dead ends: 50307 [2025-04-13 18:22:54,675 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=218, Invalid=972, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 18:22:54,675 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 444 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:54,675 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 171 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:22:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50307 states. [2025-04-13 18:22:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50307 to 38032. [2025-04-13 18:22:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38032 states, 38031 states have (on average 4.092082774578633) internal successors, (155626), 38031 states have internal predecessors, (155626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38032 states to 38032 states and 155626 transitions. [2025-04-13 18:22:56,059 INFO L79 Accepts]: Start accepts. Automaton has 38032 states and 155626 transitions. Word has length 45 [2025-04-13 18:22:56,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:56,059 INFO L485 AbstractCegarLoop]: Abstraction has 38032 states and 155626 transitions. [2025-04-13 18:22:56,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:56,059 INFO L278 IsEmpty]: Start isEmpty. Operand 38032 states and 155626 transitions. [2025-04-13 18:22:56,143 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:56,143 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:56,143 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, 1] [2025-04-13 18:22:56,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 18:22:56,144 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:56,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash -651237350, now seen corresponding path program 14 times [2025-04-13 18:22:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:56,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802027386] [2025-04-13 18:22:56,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:22:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:56,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:22:56,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:22:56,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:22:56,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:56,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:56,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:56,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802027386] [2025-04-13 18:22:56,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802027386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:56,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:56,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:56,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843409748] [2025-04-13 18:22:56,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:56,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:56,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:56,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:56,242 INFO L87 Difference]: Start difference. First operand 38032 states and 155626 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:22:57,572 INFO L93 Difference]: Finished difference Result 53717 states and 223658 transitions. [2025-04-13 18:22:57,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:22:57,572 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:22:57,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:22:57,938 INFO L225 Difference]: With dead ends: 53717 [2025-04-13 18:22:57,938 INFO L226 Difference]: Without dead ends: 51151 [2025-04-13 18:22:57,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=1054, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:22:57,968 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 403 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:22:57,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 204 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:22:58,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51151 states. [2025-04-13 18:22:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51151 to 37544. [2025-04-13 18:22:59,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37544 states, 37543 states have (on average 4.094558239884932) internal successors, (153722), 37543 states have internal predecessors, (153722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37544 states to 37544 states and 153722 transitions. [2025-04-13 18:22:59,372 INFO L79 Accepts]: Start accepts. Automaton has 37544 states and 153722 transitions. Word has length 45 [2025-04-13 18:22:59,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:22:59,372 INFO L485 AbstractCegarLoop]: Abstraction has 37544 states and 153722 transitions. [2025-04-13 18:22:59,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:22:59,372 INFO L278 IsEmpty]: Start isEmpty. Operand 37544 states and 153722 transitions. [2025-04-13 18:22:59,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:22:59,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:22:59,459 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, 1] [2025-04-13 18:22:59,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 18:22:59,459 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:22:59,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:22:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash -438798709, now seen corresponding path program 31 times [2025-04-13 18:22:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:22:59,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193617555] [2025-04-13 18:22:59,460 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:22:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:22:59,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:22:59,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:22:59,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:22:59,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:22:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:22:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:22:59,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193617555] [2025-04-13 18:22:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193617555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:22:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:22:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:22:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729581488] [2025-04-13 18:22:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:22:59,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:22:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:22:59,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:22:59,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:22:59,559 INFO L87 Difference]: Start difference. First operand 37544 states and 153722 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:00,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:00,765 INFO L93 Difference]: Finished difference Result 48827 states and 200539 transitions. [2025-04-13 18:23:00,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:23:00,765 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:00,765 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:01,090 INFO L225 Difference]: With dead ends: 48827 [2025-04-13 18:23:01,090 INFO L226 Difference]: Without dead ends: 45598 [2025-04-13 18:23:01,115 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:23:01,116 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 308 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:01,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 195 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:23:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45598 states. [2025-04-13 18:23:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45598 to 37424. [2025-04-13 18:23:02,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37424 states, 37423 states have (on average 4.09566309488817) internal successors, (153272), 37423 states have internal predecessors, (153272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37424 states to 37424 states and 153272 transitions. [2025-04-13 18:23:02,379 INFO L79 Accepts]: Start accepts. Automaton has 37424 states and 153272 transitions. Word has length 45 [2025-04-13 18:23:02,380 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:02,380 INFO L485 AbstractCegarLoop]: Abstraction has 37424 states and 153272 transitions. [2025-04-13 18:23:02,380 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:02,380 INFO L278 IsEmpty]: Start isEmpty. Operand 37424 states and 153272 transitions. [2025-04-13 18:23:02,467 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:02,468 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:02,468 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, 1] [2025-04-13 18:23:02,468 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 18:23:02,468 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:02,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 364567088, now seen corresponding path program 15 times [2025-04-13 18:23:02,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:02,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024591332] [2025-04-13 18:23:02,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:02,472 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:02,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:02,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:23:02,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:02,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:02,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024591332] [2025-04-13 18:23:02,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024591332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:02,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:02,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:02,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665727166] [2025-04-13 18:23:02,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:02,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:02,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:02,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:02,614 INFO L87 Difference]: Start difference. First operand 37424 states and 153272 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:03,943 INFO L93 Difference]: Finished difference Result 45300 states and 186287 transitions. [2025-04-13 18:23:03,944 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 18:23:03,944 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:03,944 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:04,281 INFO L225 Difference]: With dead ends: 45300 [2025-04-13 18:23:04,281 INFO L226 Difference]: Without dead ends: 42634 [2025-04-13 18:23:04,307 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2025-04-13 18:23:04,307 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 430 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:04,307 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 183 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:23:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42634 states. [2025-04-13 18:23:05,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42634 to 34464. [2025-04-13 18:23:05,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34464 states, 34463 states have (on average 4.083393784638598) internal successors, (140726), 34463 states have internal predecessors, (140726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:05,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34464 states to 34464 states and 140726 transitions. [2025-04-13 18:23:05,567 INFO L79 Accepts]: Start accepts. Automaton has 34464 states and 140726 transitions. Word has length 45 [2025-04-13 18:23:05,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:05,568 INFO L485 AbstractCegarLoop]: Abstraction has 34464 states and 140726 transitions. [2025-04-13 18:23:05,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:05,568 INFO L278 IsEmpty]: Start isEmpty. Operand 34464 states and 140726 transitions. [2025-04-13 18:23:05,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:05,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:05,647 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, 1] [2025-04-13 18:23:05,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 18:23:05,647 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:05,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1892522245, now seen corresponding path program 32 times [2025-04-13 18:23:05,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:05,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357637058] [2025-04-13 18:23:05,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:05,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:05,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:05,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:05,654 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:05,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:05,729 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357637058] [2025-04-13 18:23:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357637058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:05,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:05,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420715390] [2025-04-13 18:23:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:05,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:05,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:05,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:05,730 INFO L87 Difference]: Start difference. First operand 34464 states and 140726 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:06,929 INFO L93 Difference]: Finished difference Result 51076 states and 210725 transitions. [2025-04-13 18:23:06,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 18:23:06,930 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:06,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:07,282 INFO L225 Difference]: With dead ends: 51076 [2025-04-13 18:23:07,282 INFO L226 Difference]: Without dead ends: 46870 [2025-04-13 18:23:07,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=1041, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 18:23:07,313 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 518 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:07,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 224 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:23:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46870 states. [2025-04-13 18:23:08,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46870 to 36906. [2025-04-13 18:23:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36906 states, 36905 states have (on average 4.097222598563881) internal successors, (151208), 36905 states have internal predecessors, (151208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36906 states to 36906 states and 151208 transitions. [2025-04-13 18:23:08,690 INFO L79 Accepts]: Start accepts. Automaton has 36906 states and 151208 transitions. Word has length 45 [2025-04-13 18:23:08,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:08,690 INFO L485 AbstractCegarLoop]: Abstraction has 36906 states and 151208 transitions. [2025-04-13 18:23:08,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:08,690 INFO L278 IsEmpty]: Start isEmpty. Operand 36906 states and 151208 transitions. [2025-04-13 18:23:08,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:08,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:08,774 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, 1] [2025-04-13 18:23:08,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 18:23:08,774 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:08,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:08,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1058530525, now seen corresponding path program 33 times [2025-04-13 18:23:08,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:08,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038890155] [2025-04-13 18:23:08,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:08,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:08,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:08,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:23:08,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:08,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:08,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038890155] [2025-04-13 18:23:08,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038890155] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:08,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:08,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212278748] [2025-04-13 18:23:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:08,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:08,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:08,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:08,854 INFO L87 Difference]: Start difference. First operand 36906 states and 151208 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:09,951 INFO L93 Difference]: Finished difference Result 50532 states and 206984 transitions. [2025-04-13 18:23:09,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:23:09,952 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:09,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:10,309 INFO L225 Difference]: With dead ends: 50532 [2025-04-13 18:23:10,309 INFO L226 Difference]: Without dead ends: 47303 [2025-04-13 18:23:10,341 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:23:10,342 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 407 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 1564 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:10,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 195 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:23:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47303 states. [2025-04-13 18:23:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47303 to 36998. [2025-04-13 18:23:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36998 states, 36997 states have (on average 4.096278076600806) internal successors, (151550), 36997 states have internal predecessors, (151550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36998 states to 36998 states and 151550 transitions. [2025-04-13 18:23:11,753 INFO L79 Accepts]: Start accepts. Automaton has 36998 states and 151550 transitions. Word has length 45 [2025-04-13 18:23:11,753 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:11,753 INFO L485 AbstractCegarLoop]: Abstraction has 36998 states and 151550 transitions. [2025-04-13 18:23:11,753 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:11,753 INFO L278 IsEmpty]: Start isEmpty. Operand 36998 states and 151550 transitions. [2025-04-13 18:23:11,836 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:11,836 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:11,836 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, 1] [2025-04-13 18:23:11,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 18:23:11,836 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:11,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:11,836 INFO L85 PathProgramCache]: Analyzing trace with hash -619306223, now seen corresponding path program 34 times [2025-04-13 18:23:11,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:11,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980821944] [2025-04-13 18:23:11,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:11,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:11,840 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:11,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:23:11,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:11,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:12,025 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980821944] [2025-04-13 18:23:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980821944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 18:23:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395241067] [2025-04-13 18:23:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:12,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 18:23:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 18:23:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:23:12,026 INFO L87 Difference]: Start difference. First operand 36998 states and 151550 transitions. Second operand has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:14,144 INFO L93 Difference]: Finished difference Result 60389 states and 258855 transitions. [2025-04-13 18:23:14,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 18:23:14,145 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:14,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:14,576 INFO L225 Difference]: With dead ends: 60389 [2025-04-13 18:23:14,576 INFO L226 Difference]: Without dead ends: 56887 [2025-04-13 18:23:14,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=311, Invalid=2041, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 18:23:14,596 INFO L437 NwaCegarLoop]: 49 mSDtfsCounter, 660 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:14,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 465 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 18:23:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56887 states. [2025-04-13 18:23:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56887 to 37038. [2025-04-13 18:23:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37038 states, 37037 states have (on average 4.095904095904096) internal successors, (151700), 37037 states have internal predecessors, (151700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37038 states to 37038 states and 151700 transitions. [2025-04-13 18:23:16,165 INFO L79 Accepts]: Start accepts. Automaton has 37038 states and 151700 transitions. Word has length 45 [2025-04-13 18:23:16,165 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:16,165 INFO L485 AbstractCegarLoop]: Abstraction has 37038 states and 151700 transitions. [2025-04-13 18:23:16,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 15 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:16,166 INFO L278 IsEmpty]: Start isEmpty. Operand 37038 states and 151700 transitions. [2025-04-13 18:23:16,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:16,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:16,251 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, 1] [2025-04-13 18:23:16,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 18:23:16,251 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:16,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 153261169, now seen corresponding path program 35 times [2025-04-13 18:23:16,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:16,252 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420252925] [2025-04-13 18:23:16,252 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:16,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:16,256 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:16,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:23:16,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:16,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:16,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420252925] [2025-04-13 18:23:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420252925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744080947] [2025-04-13 18:23:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:16,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:16,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:16,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:16,356 INFO L87 Difference]: Start difference. First operand 37038 states and 151700 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:17,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:17,533 INFO L93 Difference]: Finished difference Result 45895 states and 189844 transitions. [2025-04-13 18:23:17,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 18:23:17,533 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:17,533 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:17,867 INFO L225 Difference]: With dead ends: 45895 [2025-04-13 18:23:17,867 INFO L226 Difference]: Without dead ends: 43050 [2025-04-13 18:23:17,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:23:17,887 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 345 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:17,887 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 228 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:23:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43050 states. [2025-04-13 18:23:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43050 to 37428. [2025-04-13 18:23:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37428 states, 37427 states have (on average 4.097656771849199) internal successors, (153363), 37427 states have internal predecessors, (153363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37428 states to 37428 states and 153363 transitions. [2025-04-13 18:23:18,986 INFO L79 Accepts]: Start accepts. Automaton has 37428 states and 153363 transitions. Word has length 45 [2025-04-13 18:23:18,986 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:18,986 INFO L485 AbstractCegarLoop]: Abstraction has 37428 states and 153363 transitions. [2025-04-13 18:23:18,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:18,986 INFO L278 IsEmpty]: Start isEmpty. Operand 37428 states and 153363 transitions. [2025-04-13 18:23:19,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:19,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:19,067 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, 1] [2025-04-13 18:23:19,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 18:23:19,067 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:19,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1329556470, now seen corresponding path program 16 times [2025-04-13 18:23:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:19,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066795109] [2025-04-13 18:23:19,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:19,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:19,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:19,073 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 38 of 45 statements. [2025-04-13 18:23:19,073 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:23:19,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:19,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:19,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066795109] [2025-04-13 18:23:19,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066795109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:19,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:19,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 18:23:19,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833271236] [2025-04-13 18:23:19,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:19,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:23:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:19,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:23:19,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:23:19,130 INFO L87 Difference]: Start difference. First operand 37428 states and 153363 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:19,975 INFO L93 Difference]: Finished difference Result 61875 states and 265611 transitions. [2025-04-13 18:23:19,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:23:19,975 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:19,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:20,645 INFO L225 Difference]: With dead ends: 61875 [2025-04-13 18:23:20,646 INFO L226 Difference]: Without dead ends: 53924 [2025-04-13 18:23:20,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:20,666 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 150 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:20,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 205 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 18:23:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53924 states. [2025-04-13 18:23:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53924 to 38184. [2025-04-13 18:23:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38184 states, 38183 states have (on average 4.10596338684755) internal successors, (156778), 38183 states have internal predecessors, (156778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38184 states to 38184 states and 156778 transitions. [2025-04-13 18:23:21,873 INFO L79 Accepts]: Start accepts. Automaton has 38184 states and 156778 transitions. Word has length 45 [2025-04-13 18:23:21,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:21,874 INFO L485 AbstractCegarLoop]: Abstraction has 38184 states and 156778 transitions. [2025-04-13 18:23:21,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:21,874 INFO L278 IsEmpty]: Start isEmpty. Operand 38184 states and 156778 transitions. [2025-04-13 18:23:22,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:22,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:22,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:23:22,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 18:23:22,209 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:22,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:22,209 INFO L85 PathProgramCache]: Analyzing trace with hash 219171524, now seen corresponding path program 17 times [2025-04-13 18:23:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:22,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257215646] [2025-04-13 18:23:22,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:23:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:22,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:22,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:23:22,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:23:22,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:22,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:22,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257215646] [2025-04-13 18:23:22,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257215646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:22,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:22,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:22,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844453550] [2025-04-13 18:23:22,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:22,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:22,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:22,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:22,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:22,303 INFO L87 Difference]: Start difference. First operand 38184 states and 156778 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:23,690 INFO L93 Difference]: Finished difference Result 50534 states and 208154 transitions. [2025-04-13 18:23:23,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:23:23,690 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:23,690 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:24,058 INFO L225 Difference]: With dead ends: 50534 [2025-04-13 18:23:24,058 INFO L226 Difference]: Without dead ends: 47484 [2025-04-13 18:23:24,080 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=1206, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 18:23:24,081 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 548 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:24,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 210 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:23:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47484 states. [2025-04-13 18:23:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47484 to 35090. [2025-04-13 18:23:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35090 states, 35089 states have (on average 4.092507623471743) internal successors, (143602), 35089 states have internal predecessors, (143602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35090 states to 35090 states and 143602 transitions. [2025-04-13 18:23:25,498 INFO L79 Accepts]: Start accepts. Automaton has 35090 states and 143602 transitions. Word has length 45 [2025-04-13 18:23:25,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:25,498 INFO L485 AbstractCegarLoop]: Abstraction has 35090 states and 143602 transitions. [2025-04-13 18:23:25,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:25,498 INFO L278 IsEmpty]: Start isEmpty. Operand 35090 states and 143602 transitions. [2025-04-13 18:23:25,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:25,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:25,578 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, 1] [2025-04-13 18:23:25,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 18:23:25,579 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:25,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -749074797, now seen corresponding path program 36 times [2025-04-13 18:23:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:25,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255573820] [2025-04-13 18:23:25,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:23:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:25,583 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:25,586 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:25,586 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:23:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:25,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:25,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255573820] [2025-04-13 18:23:25,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255573820] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:25,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:25,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:25,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831902102] [2025-04-13 18:23:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:25,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:25,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:25,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:25,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:25,680 INFO L87 Difference]: Start difference. First operand 35090 states and 143602 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:27,073 INFO L93 Difference]: Finished difference Result 57277 states and 237784 transitions. [2025-04-13 18:23:27,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 18:23:27,074 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:27,074 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:27,642 INFO L225 Difference]: With dead ends: 57277 [2025-04-13 18:23:27,642 INFO L226 Difference]: Without dead ends: 53071 [2025-04-13 18:23:27,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 18:23:27,660 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 504 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:27,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 231 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:23:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53071 states. [2025-04-13 18:23:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53071 to 34426. [2025-04-13 18:23:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34426 states, 34425 states have (on average 4.095511982570806) internal successors, (140988), 34425 states have internal predecessors, (140988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34426 states to 34426 states and 140988 transitions. [2025-04-13 18:23:28,845 INFO L79 Accepts]: Start accepts. Automaton has 34426 states and 140988 transitions. Word has length 45 [2025-04-13 18:23:28,845 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:28,845 INFO L485 AbstractCegarLoop]: Abstraction has 34426 states and 140988 transitions. [2025-04-13 18:23:28,845 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:28,845 INFO L278 IsEmpty]: Start isEmpty. Operand 34426 states and 140988 transitions. [2025-04-13 18:23:28,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:28,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:28,919 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, 1] [2025-04-13 18:23:28,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 18:23:28,919 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:28,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -784672627, now seen corresponding path program 37 times [2025-04-13 18:23:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:28,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050278938] [2025-04-13 18:23:28,920 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:23:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:28,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 18:23:28,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:23:28,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:23:28,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:29,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050278938] [2025-04-13 18:23:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050278938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:29,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:29,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:29,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474132181] [2025-04-13 18:23:29,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:29,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:29,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:29,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:29,009 INFO L87 Difference]: Start difference. First operand 34426 states and 140988 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:30,569 INFO L93 Difference]: Finished difference Result 63935 states and 266832 transitions. [2025-04-13 18:23:30,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 18:23:30,569 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:30,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:31,238 INFO L225 Difference]: With dead ends: 63935 [2025-04-13 18:23:31,238 INFO L226 Difference]: Without dead ends: 58731 [2025-04-13 18:23:31,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=353, Invalid=1809, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 18:23:31,256 INFO L437 NwaCegarLoop]: 38 mSDtfsCounter, 621 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:31,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 263 Invalid, 1944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:23:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58731 states. [2025-04-13 18:23:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58731 to 36744. [2025-04-13 18:23:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36744 states, 36743 states have (on average 4.081838717578859) internal successors, (149979), 36743 states have internal predecessors, (149979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36744 states to 36744 states and 149979 transitions. [2025-04-13 18:23:32,831 INFO L79 Accepts]: Start accepts. Automaton has 36744 states and 149979 transitions. Word has length 45 [2025-04-13 18:23:32,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:32,831 INFO L485 AbstractCegarLoop]: Abstraction has 36744 states and 149979 transitions. [2025-04-13 18:23:32,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:32,831 INFO L278 IsEmpty]: Start isEmpty. Operand 36744 states and 149979 transitions. [2025-04-13 18:23:32,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:32,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:32,922 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, 1] [2025-04-13 18:23:32,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 18:23:32,922 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:32,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1764510375, now seen corresponding path program 38 times [2025-04-13 18:23:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:32,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857224484] [2025-04-13 18:23:32,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:23:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:32,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:32,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:32,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:23:32,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:33,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:33,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857224484] [2025-04-13 18:23:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857224484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021308394] [2025-04-13 18:23:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:33,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:33,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:33,061 INFO L87 Difference]: Start difference. First operand 36744 states and 149979 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:34,616 INFO L93 Difference]: Finished difference Result 55709 states and 230496 transitions. [2025-04-13 18:23:34,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 18:23:34,616 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:34,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:35,009 INFO L225 Difference]: With dead ends: 55709 [2025-04-13 18:23:35,009 INFO L226 Difference]: Without dead ends: 52480 [2025-04-13 18:23:35,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 18:23:35,038 INFO L437 NwaCegarLoop]: 39 mSDtfsCounter, 445 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:35,038 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 273 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:23:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52480 states. [2025-04-13 18:23:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52480 to 36744. [2025-04-13 18:23:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36744 states, 36743 states have (on average 4.081838717578859) internal successors, (149979), 36743 states have internal predecessors, (149979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36744 states to 36744 states and 149979 transitions. [2025-04-13 18:23:36,466 INFO L79 Accepts]: Start accepts. Automaton has 36744 states and 149979 transitions. Word has length 45 [2025-04-13 18:23:36,466 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:36,466 INFO L485 AbstractCegarLoop]: Abstraction has 36744 states and 149979 transitions. [2025-04-13 18:23:36,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:36,466 INFO L278 IsEmpty]: Start isEmpty. Operand 36744 states and 149979 transitions. [2025-04-13 18:23:36,549 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:36,549 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:36,549 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, 1] [2025-04-13 18:23:36,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 18:23:36,549 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:36,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash -94540399, now seen corresponding path program 39 times [2025-04-13 18:23:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:36,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834811789] [2025-04-13 18:23:36,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:23:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:36,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:36,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 44 of 45 statements. [2025-04-13 18:23:36,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:23:36,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:36,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834811789] [2025-04-13 18:23:36,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834811789] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:36,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:36,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:36,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149743043] [2025-04-13 18:23:36,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:36,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:36,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:36,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:36,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:36,642 INFO L87 Difference]: Start difference. First operand 36744 states and 149979 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:37,984 INFO L93 Difference]: Finished difference Result 53697 states and 223575 transitions. [2025-04-13 18:23:37,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 18:23:37,984 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:37,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:38,576 INFO L225 Difference]: With dead ends: 53697 [2025-04-13 18:23:38,576 INFO L226 Difference]: Without dead ends: 49491 [2025-04-13 18:23:38,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=886, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 18:23:38,596 INFO L437 NwaCegarLoop]: 33 mSDtfsCounter, 528 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:38,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 237 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 18:23:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49491 states. [2025-04-13 18:23:39,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49491 to 36796. [2025-04-13 18:23:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36796 states, 36795 states have (on average 4.0840875118902025) internal successors, (150274), 36795 states have internal predecessors, (150274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36796 states to 36796 states and 150274 transitions. [2025-04-13 18:23:39,729 INFO L79 Accepts]: Start accepts. Automaton has 36796 states and 150274 transitions. Word has length 45 [2025-04-13 18:23:39,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:23:39,729 INFO L485 AbstractCegarLoop]: Abstraction has 36796 states and 150274 transitions. [2025-04-13 18:23:39,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:39,729 INFO L278 IsEmpty]: Start isEmpty. Operand 36796 states and 150274 transitions. [2025-04-13 18:23:39,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 18:23:39,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:23:39,807 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, 1] [2025-04-13 18:23:39,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 18:23:39,807 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:23:39,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:23:39,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2104995825, now seen corresponding path program 40 times [2025-04-13 18:23:39,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:23:39,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774405608] [2025-04-13 18:23:39,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:23:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:23:39,813 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 18:23:39,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 18:23:39,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:23:39,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:23:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:23:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:23:39,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774405608] [2025-04-13 18:23:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774405608] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:23:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:23:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 18:23:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960382628] [2025-04-13 18:23:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:23:39,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 18:23:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:23:39,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 18:23:39,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-04-13 18:23:39,899 INFO L87 Difference]: Start difference. First operand 36796 states and 150274 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:23:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:23:41,147 INFO L93 Difference]: Finished difference Result 45314 states and 187241 transitions. [2025-04-13 18:23:41,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 18:23:41,147 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-04-13 18:23:41,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:23:41,482 INFO L225 Difference]: With dead ends: 45314 [2025-04-13 18:23:41,482 INFO L226 Difference]: Without dead ends: 42134 [2025-04-13 18:23:41,505 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-04-13 18:23:41,506 INFO L437 NwaCegarLoop]: 31 mSDtfsCounter, 402 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:23:41,506 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 234 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:23:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42134 states.