/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-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:45:01,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:45:01,313 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:45:01,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:45:01,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:45:01,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:45:01,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:45:01,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:45:01,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:45:01,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:45:01,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:45:01,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:45:01,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:45:01,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:45:01,342 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:45:01,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:45:01,343 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:45:01,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:45:01,344 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:45:01,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:45:01,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:45:01,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:45:01,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:45:01,345 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:45:01,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:45:01,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:45:01,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:45:01,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:45:01,543 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:45:01,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 18:45:02,795 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6dfdae6/db94dcebc8a34434ad18247dd1b7e71e/FLAG42eb7480b [2025-04-13 18:45:02,980 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:45:02,980 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2025-04-13 18:45:03,003 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6dfdae6/db94dcebc8a34434ad18247dd1b7e71e/FLAG42eb7480b [2025-04-13 18:45:03,845 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a6dfdae6/db94dcebc8a34434ad18247dd1b7e71e [2025-04-13 18:45:03,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:45:03,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:45:03,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:45:03,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:45:03,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:45:03,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:45:03" (1/1) ... [2025-04-13 18:45:03,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781f50fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:03, skipping insertion in model container [2025-04-13 18:45:03,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:45:03" (1/1) ... [2025-04-13 18:45:03,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:45:04,000 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-simple-array-sum.wvr.c[2429,2442] [2025-04-13 18:45:04,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:45:04,018 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:45:04,041 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-simple-array-sum.wvr.c[2429,2442] [2025-04-13 18:45:04,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:45:04,054 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:45:04,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04 WrapperNode [2025-04-13 18:45:04,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:45:04,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:45:04,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:45:04,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:45:04,059 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:45:04" (1/1) ... [2025-04-13 18:45:04,066 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:45:04" (1/1) ... [2025-04-13 18:45:04,084 INFO L138 Inliner]: procedures = 23, calls = 20, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 103 [2025-04-13 18:45:04,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:45:04,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:45:04,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:45:04,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:45:04,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,110 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 18:45:04,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,119 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:45:04,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:45:04,134 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:45:04,134 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:45:04,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (1/1) ... [2025-04-13 18:45:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:45:04,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:04,163 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:45:04,166 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:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:45:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:45:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:45:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:45:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:45:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:45:04,183 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:45:04,247 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:45:04,248 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:45:04,437 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:45:04,438 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:45:04,438 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:45:04,611 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:45:04,612 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:45:04,617 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 18:45:04,625 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:45:04,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:45:04 BoogieIcfgContainer [2025-04-13 18:45:04,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:45:04,627 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:45:04,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:45:04,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:45:04,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:45:03" (1/3) ... [2025-04-13 18:45:04,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f06d39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:45:04, skipping insertion in model container [2025-04-13 18:45:04,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:45:04" (2/3) ... [2025-04-13 18:45:04,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f06d39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:45:04, skipping insertion in model container [2025-04-13 18:45:04,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:45:04" (3/3) ... [2025-04-13 18:45:04,632 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2025-04-13 18:45:04,641 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:45:04,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-simple-array-sum.wvr.c that has 4 procedures, 31 locations, 37 edges, 1 initial locations, 5 loop locations, and 1 error locations. [2025-04-13 18:45:04,644 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:45:04,689 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 18:45:04,709 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 43 transitions, 107 flow [2025-04-13 18:45:04,756 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,772 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:45:04,782 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;@5da47b78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:45:04,782 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 18:45:04,785 INFO L278 IsEmpty]: Start isEmpty. Operand has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:04,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 18:45:04,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:04,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:04,796 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:04,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash 14832570, now seen corresponding path program 1 times [2025-04-13 18:45:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:04,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534760514] [2025-04-13 18:45:04,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:04,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 18:45:04,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 18:45:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:05,386 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:45:05,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:05,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534760514] [2025-04-13 18:45:05,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534760514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:05,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:05,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:45:05,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052740042] [2025-04-13 18:45:05,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:05,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:05,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:05,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:05,409 INFO L87 Difference]: Start difference. First operand has 454 states, 453 states have (on average 4.3885209713024285) internal successors, (1988), 453 states have internal predecessors, (1988), 0 states have call successors, (0), 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 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:05,643 INFO L93 Difference]: Finished difference Result 1161 states and 4963 transitions. [2025-04-13 18:45:05,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:05,645 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-04-13 18:45:05,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:05,664 INFO L225 Difference]: With dead ends: 1161 [2025-04-13 18:45:05,664 INFO L226 Difference]: Without dead ends: 682 [2025-04-13 18:45:05,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:05,672 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:05,672 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 8 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-04-13 18:45:05,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 442. [2025-04-13 18:45:05,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.673469387755102) internal successors, (1620), 441 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1620 transitions. [2025-04-13 18:45:05,742 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1620 transitions. Word has length 16 [2025-04-13 18:45:05,743 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:05,743 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1620 transitions. [2025-04-13 18:45:05,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,744 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1620 transitions. [2025-04-13 18:45:05,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:45:05,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:05,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:05,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:45:05,748 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:05,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1545686599, now seen corresponding path program 1 times [2025-04-13 18:45:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:05,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923380909] [2025-04-13 18:45:05,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:05,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:05,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:45:05,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:45:05,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:05,827 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:45:05,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:05,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923380909] [2025-04-13 18:45:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923380909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:45:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043744872] [2025-04-13 18:45:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:05,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:05,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:05,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:05,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:05,829 INFO L87 Difference]: Start difference. First operand 442 states and 1620 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:05,936 INFO L93 Difference]: Finished difference Result 821 states and 2912 transitions. [2025-04-13 18:45:05,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:05,936 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:45:05,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:05,942 INFO L225 Difference]: With dead ends: 821 [2025-04-13 18:45:05,942 INFO L226 Difference]: Without dead ends: 626 [2025-04-13 18:45:05,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:05,945 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:05,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 9 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:05,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2025-04-13 18:45:05,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 403. [2025-04-13 18:45:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 3.3333333333333335) internal successors, (1340), 402 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1340 transitions. [2025-04-13 18:45:05,971 INFO L79 Accepts]: Start accepts. Automaton has 403 states and 1340 transitions. Word has length 18 [2025-04-13 18:45:05,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:05,971 INFO L485 AbstractCegarLoop]: Abstraction has 403 states and 1340 transitions. [2025-04-13 18:45:05,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:05,971 INFO L278 IsEmpty]: Start isEmpty. Operand 403 states and 1340 transitions. [2025-04-13 18:45:05,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 18:45:05,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:05,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:05,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:45:05,972 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:05,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:05,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2033976049, now seen corresponding path program 2 times [2025-04-13 18:45:05,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:05,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713430990] [2025-04-13 18:45:05,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:05,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:05,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 18:45:05,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 18:45:05,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:45:05,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,029 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:45:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713430990] [2025-04-13 18:45:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713430990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:45:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245187413] [2025-04-13 18:45:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:45:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:45:06,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:06,031 INFO L87 Difference]: Start difference. First operand 403 states and 1340 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,091 INFO L93 Difference]: Finished difference Result 598 states and 1853 transitions. [2025-04-13 18:45:06,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:45:06,091 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 18:45:06,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,094 INFO L225 Difference]: With dead ends: 598 [2025-04-13 18:45:06,094 INFO L226 Difference]: Without dead ends: 390 [2025-04-13 18:45:06,095 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:06,095 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,095 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-04-13 18:45:06,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-04-13 18:45:06,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 3.308483290488432) internal successors, (1287), 389 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1287 transitions. [2025-04-13 18:45:06,109 INFO L79 Accepts]: Start accepts. Automaton has 390 states and 1287 transitions. Word has length 18 [2025-04-13 18:45:06,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,109 INFO L485 AbstractCegarLoop]: Abstraction has 390 states and 1287 transitions. [2025-04-13 18:45:06,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,109 INFO L278 IsEmpty]: Start isEmpty. Operand 390 states and 1287 transitions. [2025-04-13 18:45:06,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:45:06,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,110 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] [2025-04-13 18:45:06,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:45:06,110 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:06,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1290988128, now seen corresponding path program 1 times [2025-04-13 18:45:06,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734561200] [2025-04-13 18:45:06,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:06,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:45:06,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:45:06,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:06,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,169 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:45:06,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734561200] [2025-04-13 18:45:06,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734561200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:45:06,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113067024] [2025-04-13 18:45:06,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:45:06,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:45:06,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:06,171 INFO L87 Difference]: Start difference. First operand 390 states and 1287 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,217 INFO L93 Difference]: Finished difference Result 680 states and 2261 transitions. [2025-04-13 18:45:06,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:45:06,217 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:45:06,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,220 INFO L225 Difference]: With dead ends: 680 [2025-04-13 18:45:06,220 INFO L226 Difference]: Without dead ends: 422 [2025-04-13 18:45:06,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:45:06,221 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-04-13 18:45:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2025-04-13 18:45:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.178147268408551) internal successors, (1338), 421 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1338 transitions. [2025-04-13 18:45:06,245 INFO L79 Accepts]: Start accepts. Automaton has 422 states and 1338 transitions. Word has length 26 [2025-04-13 18:45:06,245 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,245 INFO L485 AbstractCegarLoop]: Abstraction has 422 states and 1338 transitions. [2025-04-13 18:45:06,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,246 INFO L278 IsEmpty]: Start isEmpty. Operand 422 states and 1338 transitions. [2025-04-13 18:45:06,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 18:45:06,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,247 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] [2025-04-13 18:45:06,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:45:06,247 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:06,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash 842028816, now seen corresponding path program 2 times [2025-04-13 18:45:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121934904] [2025-04-13 18:45:06,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-13 18:45:06,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 18:45:06,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:45:06,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,314 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:45:06,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121934904] [2025-04-13 18:45:06,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121934904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:45:06,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933121085] [2025-04-13 18:45:06,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:06,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:06,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:06,315 INFO L87 Difference]: Start difference. First operand 422 states and 1338 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,391 INFO L93 Difference]: Finished difference Result 747 states and 2424 transitions. [2025-04-13 18:45:06,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:45:06,392 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 18:45:06,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,395 INFO L225 Difference]: With dead ends: 747 [2025-04-13 18:45:06,395 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 18:45:06,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,396 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 18:45:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-04-13 18:45:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 3.0988142292490117) internal successors, (1568), 506 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1568 transitions. [2025-04-13 18:45:06,411 INFO L79 Accepts]: Start accepts. Automaton has 507 states and 1568 transitions. Word has length 26 [2025-04-13 18:45:06,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,411 INFO L485 AbstractCegarLoop]: Abstraction has 507 states and 1568 transitions. [2025-04-13 18:45:06,411 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,411 INFO L278 IsEmpty]: Start isEmpty. Operand 507 states and 1568 transitions. [2025-04-13 18:45:06,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 18:45:06,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:06,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:45:06,412 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:06,413 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1188193474, now seen corresponding path program 1 times [2025-04-13 18:45:06,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285877583] [2025-04-13 18:45:06,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:06,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 18:45:06,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 18:45:06,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:06,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285877583] [2025-04-13 18:45:06,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285877583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:45:06,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538587486] [2025-04-13 18:45:06,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:45:06,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:45:06,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:45:06,495 INFO L87 Difference]: Start difference. First operand 507 states and 1568 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,563 INFO L93 Difference]: Finished difference Result 1014 states and 3137 transitions. [2025-04-13 18:45:06,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:06,563 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 18:45:06,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,567 INFO L225 Difference]: With dead ends: 1014 [2025-04-13 18:45:06,567 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 18:45:06,568 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,569 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,570 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 18:45:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-04-13 18:45:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 3.090551181102362) internal successors, (1570), 508 states have internal predecessors, (1570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1570 transitions. [2025-04-13 18:45:06,583 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1570 transitions. Word has length 31 [2025-04-13 18:45:06,583 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,583 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1570 transitions. [2025-04-13 18:45:06,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,584 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1570 transitions. [2025-04-13 18:45:06,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:45:06,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,585 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:06,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:45:06,585 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:06,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1899695730, now seen corresponding path program 1 times [2025-04-13 18:45:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619276611] [2025-04-13 18:45:06,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:45:06,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:45:06,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:06,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619276611] [2025-04-13 18:45:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619276611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:45:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548811140] [2025-04-13 18:45:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,671 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:45:06,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:45:06,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,672 INFO L87 Difference]: Start difference. First operand 509 states and 1570 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:45:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:06,782 INFO L93 Difference]: Finished difference Result 1052 states and 3129 transitions. [2025-04-13 18:45:06,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:06,782 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:45:06,782 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:06,787 INFO L225 Difference]: With dead ends: 1052 [2025-04-13 18:45:06,787 INFO L226 Difference]: Without dead ends: 891 [2025-04-13 18:45:06,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:06,789 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:06,789 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 21 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:06,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-04-13 18:45:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 521. [2025-04-13 18:45:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 3.076923076923077) internal successors, (1600), 520 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1600 transitions. [2025-04-13 18:45:06,807 INFO L79 Accepts]: Start accepts. Automaton has 521 states and 1600 transitions. Word has length 33 [2025-04-13 18:45:06,808 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:06,808 INFO L485 AbstractCegarLoop]: Abstraction has 521 states and 1600 transitions. [2025-04-13 18:45:06,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:45:06,808 INFO L278 IsEmpty]: Start isEmpty. Operand 521 states and 1600 transitions. [2025-04-13 18:45:06,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:45:06,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:06,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:06,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:45:06,809 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:06,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1614011774, now seen corresponding path program 2 times [2025-04-13 18:45:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:06,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331369150] [2025-04-13 18:45:06,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:06,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:06,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:06,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:45:06,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:06,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:06,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331369150] [2025-04-13 18:45:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331369150] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:45:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533324531] [2025-04-13 18:45:06,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:06,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:45:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:06,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:45:06,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:45:06,904 INFO L87 Difference]: Start difference. First operand 521 states and 1600 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:07,100 INFO L93 Difference]: Finished difference Result 1255 states and 4262 transitions. [2025-04-13 18:45:07,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 18:45:07,101 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,101 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:07,108 INFO L225 Difference]: With dead ends: 1255 [2025-04-13 18:45:07,108 INFO L226 Difference]: Without dead ends: 1177 [2025-04-13 18:45:07,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:45:07,109 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 65 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:07,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 28 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:45:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-04-13 18:45:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 841. [2025-04-13 18:45:07,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.2523809523809524) internal successors, (2732), 840 states have internal predecessors, (2732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2732 transitions. [2025-04-13 18:45:07,133 INFO L79 Accepts]: Start accepts. Automaton has 841 states and 2732 transitions. Word has length 33 [2025-04-13 18:45:07,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:07,133 INFO L485 AbstractCegarLoop]: Abstraction has 841 states and 2732 transitions. [2025-04-13 18:45:07,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,134 INFO L278 IsEmpty]: Start isEmpty. Operand 841 states and 2732 transitions. [2025-04-13 18:45:07,135 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:45:07,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:07,136 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:07,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:45:07,136 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:07,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:07,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1934847174, now seen corresponding path program 3 times [2025-04-13 18:45:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:07,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889493163] [2025-04-13 18:45:07,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:45:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:07,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:07,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:45:07,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:45:07,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:07,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:07,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889493163] [2025-04-13 18:45:07,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889493163] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:07,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:07,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:45:07,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392049799] [2025-04-13 18:45:07,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:07,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:45:07,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:07,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:45:07,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:45:07,281 INFO L87 Difference]: Start difference. First operand 841 states and 2732 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:07,440 INFO L93 Difference]: Finished difference Result 1389 states and 4535 transitions. [2025-04-13 18:45:07,441 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:45:07,441 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:07,448 INFO L225 Difference]: With dead ends: 1389 [2025-04-13 18:45:07,448 INFO L226 Difference]: Without dead ends: 1305 [2025-04-13 18:45:07,449 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:45:07,450 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:07,450 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 21 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:07,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2025-04-13 18:45:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 841. [2025-04-13 18:45:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.2476190476190476) internal successors, (2728), 840 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2728 transitions. [2025-04-13 18:45:07,479 INFO L79 Accepts]: Start accepts. Automaton has 841 states and 2728 transitions. Word has length 33 [2025-04-13 18:45:07,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:07,480 INFO L485 AbstractCegarLoop]: Abstraction has 841 states and 2728 transitions. [2025-04-13 18:45:07,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 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:45:07,480 INFO L278 IsEmpty]: Start isEmpty. Operand 841 states and 2728 transitions. [2025-04-13 18:45:07,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:45:07,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:07,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:07,483 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:45:07,483 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:07,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2144909354, now seen corresponding path program 4 times [2025-04-13 18:45:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:07,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619881105] [2025-04-13 18:45:07,484 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:07,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:07,501 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-13 18:45:07,501 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:45:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:07,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:07,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619881105] [2025-04-13 18:45:07,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619881105] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:07,547 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845057914] [2025-04-13 18:45:07,547 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:45:07,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:07,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:07,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:07,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 18:45:07,603 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:07,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 30 of 33 statements. [2025-04-13 18:45:07,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 18:45:07,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:07,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:45:07,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:07,694 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:45:07,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845057914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:07,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:07,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 18:45:07,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829882181] [2025-04-13 18:45:07,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:07,729 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:45:07,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:07,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:45:07,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:45:07,730 INFO L87 Difference]: Start difference. First operand 841 states and 2728 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:45:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:07,859 INFO L93 Difference]: Finished difference Result 1295 states and 4201 transitions. [2025-04-13 18:45:07,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:45:07,859 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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 33 [2025-04-13 18:45:07,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:07,866 INFO L225 Difference]: With dead ends: 1295 [2025-04-13 18:45:07,866 INFO L226 Difference]: Without dead ends: 1161 [2025-04-13 18:45:07,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:45:07,867 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:07,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 19 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:07,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2025-04-13 18:45:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 953. [2025-04-13 18:45:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 952 states have (on average 3.2394957983193278) internal successors, (3084), 952 states have internal predecessors, (3084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 3084 transitions. [2025-04-13 18:45:07,898 INFO L79 Accepts]: Start accepts. Automaton has 953 states and 3084 transitions. Word has length 33 [2025-04-13 18:45:07,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:07,898 INFO L485 AbstractCegarLoop]: Abstraction has 953 states and 3084 transitions. [2025-04-13 18:45:07,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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:45:07,898 INFO L278 IsEmpty]: Start isEmpty. Operand 953 states and 3084 transitions. [2025-04-13 18:45:07,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:45:07,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:07,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:07,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:08,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 18:45:08,104 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:08,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1270750556, now seen corresponding path program 5 times [2025-04-13 18:45:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:08,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205918676] [2025-04-13 18:45:08,105 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:08,114 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:08,121 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:45:08,121 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:08,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:08,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205918676] [2025-04-13 18:45:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205918676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:08,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739550737] [2025-04-13 18:45:08,212 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:45:08,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:08,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:08,214 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:08,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 18:45:08,271 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:45:08,299 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:45:08,299 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:08,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:08,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:45:08,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:08,373 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:45:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739550737] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:08,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-13 18:45:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223785919] [2025-04-13 18:45:08,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:08,436 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 18:45:08,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:08,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 18:45:08,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 18:45:08,437 INFO L87 Difference]: Start difference. First operand 953 states and 3084 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:08,585 INFO L93 Difference]: Finished difference Result 1911 states and 6179 transitions. [2025-04-13 18:45:08,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:45:08,585 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 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:45:08,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:08,594 INFO L225 Difference]: With dead ends: 1911 [2025-04-13 18:45:08,594 INFO L226 Difference]: Without dead ends: 955 [2025-04-13 18:45:08,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:45:08,597 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:08,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 12 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-04-13 18:45:08,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2025-04-13 18:45:08,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.2348008385744236) internal successors, (3086), 954 states have internal predecessors, (3086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:08,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3086 transitions. [2025-04-13 18:45:08,624 INFO L79 Accepts]: Start accepts. Automaton has 955 states and 3086 transitions. Word has length 33 [2025-04-13 18:45:08,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:08,624 INFO L485 AbstractCegarLoop]: Abstraction has 955 states and 3086 transitions. [2025-04-13 18:45:08,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 10 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:08,624 INFO L278 IsEmpty]: Start isEmpty. Operand 955 states and 3086 transitions. [2025-04-13 18:45:08,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:45:08,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:08,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:08,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:08,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 18:45:08,827 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:08,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:08,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1736443336, now seen corresponding path program 6 times [2025-04-13 18:45:08,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:08,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838122283] [2025-04-13 18:45:08,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:45:08,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:08,842 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-04-13 18:45:08,853 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:45:08,853 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 18:45:08,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:45:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:08,919 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838122283] [2025-04-13 18:45:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838122283] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:45:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:45:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:45:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181488850] [2025-04-13 18:45:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:08,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:45:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:08,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:45:08,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:08,920 INFO L87 Difference]: Start difference. First operand 955 states and 3086 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:45:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:09,030 INFO L93 Difference]: Finished difference Result 1213 states and 3849 transitions. [2025-04-13 18:45:09,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:45:09,031 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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 35 [2025-04-13 18:45:09,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:09,036 INFO L225 Difference]: With dead ends: 1213 [2025-04-13 18:45:09,036 INFO L226 Difference]: Without dead ends: 1059 [2025-04-13 18:45:09,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:09,036 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:09,037 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 19 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-04-13 18:45:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 955. [2025-04-13 18:45:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 954 states have (on average 3.2138364779874213) internal successors, (3066), 954 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 3066 transitions. [2025-04-13 18:45:09,056 INFO L79 Accepts]: Start accepts. Automaton has 955 states and 3066 transitions. Word has length 35 [2025-04-13 18:45:09,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:09,056 INFO L485 AbstractCegarLoop]: Abstraction has 955 states and 3066 transitions. [2025-04-13 18:45:09,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 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:45:09,056 INFO L278 IsEmpty]: Start isEmpty. Operand 955 states and 3066 transitions. [2025-04-13 18:45:09,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-04-13 18:45:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:09,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:09,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:45:09,059 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:09,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -695583112, now seen corresponding path program 7 times [2025-04-13 18:45:09,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:09,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686672455] [2025-04-13 18:45:09,059 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:45:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:09,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:45:09,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:45:09,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:09,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:45:09,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:09,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686672455] [2025-04-13 18:45:09,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686672455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:09,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973400094] [2025-04-13 18:45:09,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:45:09,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:09,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:09,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 18:45:09,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 18:45:09,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 18:45:09,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:09,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 18:45:09,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:09,299 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:45:09,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:45:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973400094] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:09,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:45:09,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2025-04-13 18:45:09,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382360385] [2025-04-13 18:45:09,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:09,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:45:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:09,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:45:09,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:45:09,369 INFO L87 Difference]: Start difference. First operand 955 states and 3066 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:09,430 INFO L93 Difference]: Finished difference Result 1213 states and 3829 transitions. [2025-04-13 18:45:09,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:45:09,431 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-04-13 18:45:09,431 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:09,436 INFO L225 Difference]: With dead ends: 1213 [2025-04-13 18:45:09,436 INFO L226 Difference]: Without dead ends: 1059 [2025-04-13 18:45:09,437 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:45:09,437 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:09,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 9 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-04-13 18:45:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 739. [2025-04-13 18:45:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 3.105691056910569) internal successors, (2292), 738 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 2292 transitions. [2025-04-13 18:45:09,457 INFO L79 Accepts]: Start accepts. Automaton has 739 states and 2292 transitions. Word has length 35 [2025-04-13 18:45:09,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:09,457 INFO L485 AbstractCegarLoop]: Abstraction has 739 states and 2292 transitions. [2025-04-13 18:45:09,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:09,457 INFO L278 IsEmpty]: Start isEmpty. Operand 739 states and 2292 transitions. [2025-04-13 18:45:09,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:45:09,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:09,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:09,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:45:09,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:09,663 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:09,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:09,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1562744611, now seen corresponding path program 1 times [2025-04-13 18:45:09,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:09,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699781317] [2025-04-13 18:45:09,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:09,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:45:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:45:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:09,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699781317] [2025-04-13 18:45:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699781317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:09,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419137185] [2025-04-13 18:45:09,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:09,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:09,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:09,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:09,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 18:45:09,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:45:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:45:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:09,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:09,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 18:45:09,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:45:09,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 18:45:09,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419137185] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:09,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:45:09,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-04-13 18:45:09,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381580992] [2025-04-13 18:45:09,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:45:09,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:45:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:09,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:45:09,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:45:09,972 INFO L87 Difference]: Start difference. First operand 739 states and 2292 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:10,030 INFO L93 Difference]: Finished difference Result 1057 states and 3382 transitions. [2025-04-13 18:45:10,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:45:10,030 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 18:45:10,031 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:10,035 INFO L225 Difference]: With dead ends: 1057 [2025-04-13 18:45:10,035 INFO L226 Difference]: Without dead ends: 976 [2025-04-13 18:45:10,036 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:45:10,036 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:10,036 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 8 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:45:10,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-04-13 18:45:10,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2025-04-13 18:45:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.187692307692308) internal successors, (3108), 975 states have internal predecessors, (3108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3108 transitions. [2025-04-13 18:45:10,055 INFO L79 Accepts]: Start accepts. Automaton has 976 states and 3108 transitions. Word has length 37 [2025-04-13 18:45:10,056 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:10,056 INFO L485 AbstractCegarLoop]: Abstraction has 976 states and 3108 transitions. [2025-04-13 18:45:10,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,056 INFO L278 IsEmpty]: Start isEmpty. Operand 976 states and 3108 transitions. [2025-04-13 18:45:10,057 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 18:45:10,057 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:10,057 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:10,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 18:45:10,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:10,259 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:10,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:10,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1705457558, now seen corresponding path program 1 times [2025-04-13 18:45:10,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:10,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809372270] [2025-04-13 18:45:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:10,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:45:10,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:45:10,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:10,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:45:10,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:10,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809372270] [2025-04-13 18:45:10,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809372270] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:10,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510750292] [2025-04-13 18:45:10,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:45:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:10,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:10,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 18:45:10,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 18:45:10,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 18:45:10,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:45:10,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:10,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 18:45:10,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:10,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:45:10,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510750292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:10,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:10,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14 [2025-04-13 18:45:10,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721642179] [2025-04-13 18:45:10,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:10,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 18:45:10,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:10,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 18:45:10,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:45:10,571 INFO L87 Difference]: Start difference. First operand 976 states and 3108 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:10,892 INFO L93 Difference]: Finished difference Result 2271 states and 7361 transitions. [2025-04-13 18:45:10,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 18:45:10,892 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 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 40 [2025-04-13 18:45:10,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:10,899 INFO L225 Difference]: With dead ends: 2271 [2025-04-13 18:45:10,899 INFO L226 Difference]: Without dead ends: 1298 [2025-04-13 18:45:10,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:45:10,901 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:10,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 29 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:45:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-04-13 18:45:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1298. [2025-04-13 18:45:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.1804163454124903) internal successors, (4125), 1297 states have internal predecessors, (4125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4125 transitions. [2025-04-13 18:45:10,924 INFO L79 Accepts]: Start accepts. Automaton has 1298 states and 4125 transitions. Word has length 40 [2025-04-13 18:45:10,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:10,924 INFO L485 AbstractCegarLoop]: Abstraction has 1298 states and 4125 transitions. [2025-04-13 18:45:10,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:10,924 INFO L278 IsEmpty]: Start isEmpty. Operand 1298 states and 4125 transitions. [2025-04-13 18:45:10,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-13 18:45:10,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:45:10,926 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:45:10,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:45:11,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:45:11,127 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 18:45:11,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:45:11,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1941650870, now seen corresponding path program 2 times [2025-04-13 18:45:11,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:45:11,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559516568] [2025-04-13 18:45:11,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:45:11,134 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:45:11,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:45:11,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:11,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 18:45:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:45:11,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559516568] [2025-04-13 18:45:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559516568] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:45:11,188 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657034612] [2025-04-13 18:45:11,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:45:11,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:45:11,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:45:11,190 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:45:11,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 18:45:11,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-04-13 18:45:11,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-04-13 18:45:11,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:45:11,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:45:11,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 18:45:11,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:45:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 18:45:11,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:45:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-13 18:45:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657034612] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:45:11,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:45:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 18:45:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605540173] [2025-04-13 18:45:11,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:45:11,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:45:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:45:11,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:45:11,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:45:11,325 INFO L87 Difference]: Start difference. First operand 1298 states and 4125 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:45:11,437 INFO L93 Difference]: Finished difference Result 1298 states and 4125 transitions. [2025-04-13 18:45:11,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:45:11,437 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-13 18:45:11,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:45:11,439 INFO L225 Difference]: With dead ends: 1298 [2025-04-13 18:45:11,439 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:45:11,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 4 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:45:11,441 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:45:11,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 8 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:45:11,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:45:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:45:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:45:11,442 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2025-04-13 18:45:11,442 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:45:11,442 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:45:11,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:45:11,443 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:45:11,443 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:45:11,444 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 18:45:11,445 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 18:45:11,445 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 18:45:11,445 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 18:45:11,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:45:11,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 18:45:11,651 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 2, 2, 1, 1, 1] [2025-04-13 18:45:11,653 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:45:11,653 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:45:11,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:45:11 BasicIcfg [2025-04-13 18:45:11,655 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:45:11,655 INFO L158 Benchmark]: Toolchain (without parser) took 7807.41ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 118.0MB in the beginning and 171.3MB in the end (delta: -53.2MB). Peak memory consumption was 133.5MB. Max. memory is 8.0GB. [2025-04-13 18:45:11,655 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:45:11,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.07ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 102.1MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:45:11,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:45:11,655 INFO L158 Benchmark]: Boogie Preprocessor took 48.63ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 98.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:45:11,656 INFO L158 Benchmark]: RCFGBuilder took 491.97ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 49.5MB in the end (delta: 48.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2025-04-13 18:45:11,656 INFO L158 Benchmark]: TraceAbstraction took 7027.42ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 48.6MB in the beginning and 171.3MB in the end (delta: -122.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. [2025-04-13 18:45:11,656 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.07ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 102.1MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 167.8MB. Free memory was 102.1MB in the beginning and 100.6MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.63ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 98.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 491.97ms. Allocated memory is still 167.8MB. Free memory was 98.1MB in the beginning and 49.5MB in the end (delta: 48.7MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * TraceAbstraction took 7027.42ms. Allocated memory was 167.8MB in the beginning and 356.5MB in the end (delta: 188.7MB). Free memory was 48.6MB in the beginning and 171.3MB in the end (delta: -122.6MB). Peak memory consumption was 66.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 94]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 52 locations, 73 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 217 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 143 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2395 IncrementalHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 74 mSDtfsCounter, 2395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 434 SyntacticMatches, 17 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1298occurred in iteration=15, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 16 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 719 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 2657 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1464 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 223/276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 18:45:11,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...